%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT401-2 : TPTP v8.1.0. Released v8.1.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 : n008.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:52:03 EDT 2022 % Result : Unsatisfiable 84.25s 11.01s % Output : CNFRefutation 84.25s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : LAT401-2 : TPTP v8.1.0. Released v8.1.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.34 % Computer : n008.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Wed Jun 29 22:40:23 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.14/0.37 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.14/0.37 # % 0.14/0.37 # Number of axioms: 11 Number of unprocessed: 11 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # Hello from C++ % 0.14/0.37 # The folding up rule is enabled... % 0.14/0.37 # Local unification is enabled... % 0.14/0.37 # Any saturation attempts will use folding labels... % 0.14/0.37 # 11 beginning clauses after preprocessing and clausification % 0.14/0.37 # Creating start rules for all 3 conjectures. % 0.14/0.37 # There are 3 start rule candidates: % 0.14/0.37 # Found 11 unit axioms. % 0.14/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.37 # 3 start rule tableaux created. % 0.14/0.37 # 0 extension rule candidate clauses % 0.14/0.37 # 11 unit axiom clauses % 0.14/0.37 % 0.14/0.37 # Requested 8, 32 cores available to the main process. % 0.14/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.14/0.37 # Creating equality axioms % 0.14/0.37 # Ran out of tableaux, making start rules for all clauses % 0.14/0.37 # Returning from population with 17 new_tableaux and 0 remaining starting tableaux. % 0.14/0.37 # We now have 17 tableaux to operate on % 84.25/11.01 # There were 1 total branch saturation attempts. % 84.25/11.01 # There were 0 of these attempts blocked. % 84.25/11.01 # There were 0 deferred branch saturation attempts. % 84.25/11.01 # There were 0 free duplicated saturations. % 84.25/11.01 # There were 1 total successful branch saturations. % 84.25/11.01 # There were 0 successful branch saturations in interreduction. % 84.25/11.01 # There were 0 successful branch saturations on the branch. % 84.25/11.01 # There were 1 successful branch saturations after the branch. % 84.25/11.01 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 84.25/11.01 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 84.25/11.01 # Begin clausification derivation % 84.25/11.01 % 84.25/11.01 # End clausification derivation % 84.25/11.01 # Begin listing active clauses obtained from FOF to CNF conversion % 84.25/11.01 cnf(i_0_16, plain, (meet(X1,X2)=meet(X2,X1))). % 84.25/11.01 cnf(i_0_18, plain, (join(X1,X2)=join(X2,X1))). % 84.25/11.01 cnf(i_0_21, plain, (meet(X1,join(X1,X2))=X1)). % 84.25/11.01 cnf(i_0_20, plain, (join(X1,meet(X1,X2))=X1)). % 84.25/11.01 cnf(i_0_28, negated_conjecture, (meet(a,join(x2,z2))=meet(a,join(x2,y2)))). % 84.25/11.01 cnf(i_0_29, negated_conjecture, (meet(a,join(y2,z2))=meet(a,join(x2,y2)))). % 84.25/11.01 cnf(i_0_17, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))). % 84.25/11.01 cnf(i_0_19, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 84.25/11.01 cnf(i_0_30, negated_conjecture, (meet(join(x2,y2),join(x2,z2))!=join(x2,meet(y2,z2)))). % 84.25/11.01 cnf(i_0_27, plain, (join(meet(X1,join(X2,meet(a,X3))),meet(X1,join(X3,meet(a,X2))))=meet(X1,join(X2,X3)))). % 84.25/11.01 cnf(i_0_26, plain, (meet(join(meet(meet(a,X1),X2),X3),join(meet(meet(a,X1),X3),X2))=join(meet(meet(a,X1),join(X2,X3)),meet(X2,X3)))). % 84.25/11.01 cnf(i_0_34, plain, (X4=X4)). % 84.25/11.01 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 84.25/11.01 # Begin printing tableau % 84.25/11.01 # Found 6 steps % 84.25/11.01 cnf(i_0_18, plain, (join(X7,X8)=join(X8,X7)), inference(start_rule)). % 84.25/11.01 cnf(i_0_41, plain, (join(X7,X8)=join(X8,X7)), inference(extension_rule, [i_0_38])). % 84.25/11.01 cnf(i_0_154, plain, (meet(X10,X9)!=meet(X9,X10)), inference(closure_rule, [i_0_16])). % 84.25/11.01 cnf(i_0_152, plain, (meet(join(X7,X8),meet(X10,X9))=meet(join(X8,X7),meet(X9,X10))), inference(extension_rule, [i_0_39])). % 84.25/11.01 cnf(i_0_157, plain, (meet(X1,X2)!=meet(X2,X1)), inference(closure_rule, [i_0_16])). % 84.25/11.01 cnf(i_0_155, plain, (join(meet(join(X7,X8),meet(X10,X9)),meet(X1,X2))=join(meet(join(X8,X7),meet(X9,X10)),meet(X2,X1))), inference(etableau_closure_rule, [i_0_155, ...])). % 84.25/11.01 # End printing tableau % 84.25/11.01 # SZS output end % 84.25/11.01 # Branches closed with saturation will be marked with an "s" % 84.58/11.04 # Child (20284) has found a proof. % 84.58/11.04 % 84.58/11.04 # Proof search is over... % 84.58/11.04 # Freeing feature tree %------------------------------------------------------------------------------