%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT241-10 : TPTP v8.1.0. Released v7.5.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n019.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Sun Jul 17 04:49:41 EDT 2022 % Result : Unsatisfiable 0.18s 0.47s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : LAT241-10 : TPTP v8.1.0. Released v7.5.0. % 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n019.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Wed Jun 29 01:07:39 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.13/0.37 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Number of axioms: 15 Number of unprocessed: 15 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 15 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 1 conjectures. % 0.13/0.37 # There are 1 start rule candidates: % 0.13/0.37 # Found 15 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 0 extension rule candidate clauses % 0.13/0.37 # 15 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.37 # Creating equality axioms % 0.13/0.37 # Ran out of tableaux, making start rules for all clauses % 0.13/0.37 # Returning from population with 26 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 26 tableaux to operate on % 0.18/0.47 # There were 1 total branch saturation attempts. % 0.18/0.47 # There were 0 of these attempts blocked. % 0.18/0.47 # There were 0 deferred branch saturation attempts. % 0.18/0.47 # There were 0 free duplicated saturations. % 0.18/0.47 # There were 1 total successful branch saturations. % 0.18/0.47 # There were 0 successful branch saturations in interreduction. % 0.18/0.47 # There were 0 successful branch saturations on the branch. % 0.18/0.47 # There were 1 successful branch saturations after the branch. % 0.18/0.47 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.47 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.47 # Begin clausification derivation % 0.18/0.47 % 0.18/0.47 # End clausification derivation % 0.18/0.47 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.47 cnf(i_0_29, hypothesis, (meet(b,a)=a)). % 0.18/0.47 cnf(i_0_17, plain, (meet(X1,X1)=X1)). % 0.18/0.47 cnf(i_0_18, plain, (join(X1,X1)=X1)). % 0.18/0.47 cnf(i_0_26, plain, (meet(X1,complement(X1))=zero)). % 0.18/0.47 cnf(i_0_25, plain, (join(X1,complement(X1))=one)). % 0.18/0.47 cnf(i_0_21, plain, (meet(X1,X2)=meet(X2,X1))). % 0.18/0.47 cnf(i_0_22, plain, (join(X1,X2)=join(X2,X1))). % 0.18/0.47 cnf(i_0_30, negated_conjecture, (join(complement(b),complement(a))!=complement(a))). % 0.18/0.47 cnf(i_0_19, plain, (meet(X1,join(X1,X2))=X1)). % 0.18/0.47 cnf(i_0_20, plain, (join(X1,meet(X1,X2))=X1)). % 0.18/0.47 cnf(i_0_23, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))). % 0.18/0.47 cnf(i_0_24, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 0.18/0.47 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.18/0.47 cnf(i_0_28, plain, (meet(X1,join(X2,join(meet(X1,X3),meet(X3,X4))))=meet(X1,join(X2,meet(X3,join(X1,X4)))))). % 0.18/0.47 cnf(i_0_27, plain, (ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X1),X2),X2)=X2)). % 0.18/0.47 cnf(i_0_32, plain, (X5=X5)). % 0.18/0.47 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.47 # Begin printing tableau % 0.18/0.47 # Found 8 steps % 0.18/0.47 cnf(i_0_29, hypothesis, (meet(b,a)=a), inference(start_rule)). % 0.18/0.47 cnf(i_0_40, plain, (meet(b,a)=a), inference(extension_rule, [i_0_36])). % 0.18/0.47 cnf(i_0_64, plain, (meet(b,a)!=a), inference(closure_rule, [i_0_29])). % 0.18/0.47 cnf(i_0_66, plain, (meet(b,a)!=a), inference(closure_rule, [i_0_29])). % 0.18/0.47 cnf(i_0_67, plain, (meet(b,a)!=a), inference(closure_rule, [i_0_29])). % 0.18/0.47 cnf(i_0_63, plain, (ifeq(meet(b,a),meet(b,a),meet(b,a),meet(b,a))=ifeq(a,a,a,a)), inference(extension_rule, [i_0_35])). % 0.18/0.47 cnf(i_0_82, plain, (ifeq(a,a,a,a)!=meet(ifeq(a,a,a,a),ifeq(a,a,a,a))), inference(closure_rule, [i_0_17])). % 0.18/0.47 cnf(i_0_80, plain, (ifeq(meet(b,a),meet(b,a),meet(b,a),meet(b,a))=meet(ifeq(a,a,a,a),ifeq(a,a,a,a))), inference(etableau_closure_rule, [i_0_80, ...])). % 0.18/0.47 # End printing tableau % 0.18/0.47 # SZS output end % 0.18/0.47 # Branches closed with saturation will be marked with an "s" % 0.18/0.47 # There were 1 total branch saturation attempts. % 0.18/0.47 # There were 0 of these attempts blocked. % 0.18/0.47 # There were 0 deferred branch saturation attempts. % 0.18/0.47 # There were 0 free duplicated saturations. % 0.18/0.47 # There were 1 total successful branch saturations. % 0.18/0.47 # There were 0 successful branch saturations in interreduction. % 0.18/0.47 # There were 0 successful branch saturations on the branch. % 0.18/0.47 # There were 1 successful branch saturations after the branch. % 0.18/0.47 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.47 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.47 # Begin clausification derivation % 0.18/0.47 % 0.18/0.47 # End clausification derivation % 0.18/0.47 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.47 cnf(i_0_29, hypothesis, (meet(b,a)=a)). % 0.18/0.47 cnf(i_0_17, plain, (meet(X1,X1)=X1)). % 0.18/0.47 cnf(i_0_18, plain, (join(X1,X1)=X1)). % 0.18/0.47 cnf(i_0_26, plain, (meet(X1,complement(X1))=zero)). % 0.18/0.47 cnf(i_0_25, plain, (join(X1,complement(X1))=one)). % 0.18/0.47 cnf(i_0_21, plain, (meet(X1,X2)=meet(X2,X1))). % 0.18/0.47 cnf(i_0_22, plain, (join(X1,X2)=join(X2,X1))). % 0.18/0.47 cnf(i_0_30, negated_conjecture, (join(complement(b),complement(a))!=complement(a))). % 0.18/0.47 cnf(i_0_19, plain, (meet(X1,join(X1,X2))=X1)). % 0.18/0.47 cnf(i_0_20, plain, (join(X1,meet(X1,X2))=X1)). % 0.18/0.47 cnf(i_0_23, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))). % 0.18/0.47 cnf(i_0_24, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 0.18/0.47 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.18/0.47 cnf(i_0_28, plain, (meet(X1,join(X2,join(meet(X1,X3),meet(X3,X4))))=meet(X1,join(X2,meet(X3,join(X1,X4)))))). % 0.18/0.47 cnf(i_0_27, plain, (ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X1),X2),X2)=X2)). % 0.18/0.47 cnf(i_0_32, plain, (X5=X5)). % 0.18/0.47 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.47 # Begin printing tableau % 0.18/0.47 # Found 6 steps % 0.18/0.47 cnf(i_0_29, hypothesis, (meet(b,a)=a), inference(start_rule)). % 0.18/0.47 cnf(i_0_40, plain, (meet(b,a)=a), inference(extension_rule, [i_0_37])). % 0.18/0.47 cnf(i_0_69, plain, (meet(b,a)!=a), inference(closure_rule, [i_0_29])). % 0.18/0.47 cnf(i_0_68, plain, (meet(meet(b,a),meet(b,a))=meet(a,a)), inference(extension_rule, [i_0_35])). % 0.18/0.47 cnf(i_0_82, plain, (meet(a,a)!=a), inference(closure_rule, [i_0_17])). % 0.18/0.47 cnf(i_0_80, plain, (meet(meet(b,a),meet(b,a))=a), inference(etableau_closure_rule, [i_0_80, ...])). % 0.18/0.47 # End printing tableau % 0.18/0.47 # SZS output end % 0.18/0.47 # Branches closed with saturation will be marked with an "s" % 0.18/0.47 # Child (22620) has found a proof. % 0.18/0.47 % 0.18/0.47 # Proof search is over... % 0.18/0.47 # Freeing feature tree %------------------------------------------------------------------------------