%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT394-2 : TPTP v8.1.0. Released v5.4.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 : n032.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:51:59 EDT 2022 % Result : Unsatisfiable 0.16s 0.44s % Output : CNFRefutation 0.16s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : LAT394-2 : TPTP v8.1.0. Released v5.4.0. % 0.03/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.11/0.31 % Computer : n032.cluster.edu % 0.11/0.31 % Model : x86_64 x86_64 % 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.31 % Memory : 8042.1875MB % 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.31 % CPULimit : 300 % 0.11/0.31 % WCLimit : 600 % 0.11/0.31 % DateTime : Wed Jun 29 20:08:58 EDT 2022 % 0.11/0.31 % CPUTime : % 0.16/0.33 # No SInE strategy applied % 0.16/0.33 # Auto-Mode selected heuristic G_E___209_C18_F1_AE_CS_SP_PI_S0Y % 0.16/0.33 # and selection function SelectMaxLComplexAvoidPosPred. % 0.16/0.33 # % 0.16/0.33 # Number of axioms: 2 Number of unprocessed: 2 % 0.16/0.33 # Tableaux proof search. % 0.16/0.33 # APR header successfully linked. % 0.16/0.33 # Hello from C++ % 0.16/0.37 # The folding up rule is enabled... % 0.16/0.37 # Local unification is enabled... % 0.16/0.37 # Any saturation attempts will use folding labels... % 0.16/0.37 # 2 beginning clauses after preprocessing and clausification % 0.16/0.37 # Creating start rules for all 1 conjectures. % 0.16/0.37 # There are 1 start rule candidates: % 0.16/0.37 # Found 2 unit axioms. % 0.16/0.37 # 1 start rule tableaux created. % 0.16/0.37 # 0 extension rule candidate clauses % 0.16/0.37 # 2 unit axiom clauses % 0.16/0.37 % 0.16/0.37 # Requested 8, 32 cores available to the main process. % 0.16/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.16/0.37 # Creating equality axioms % 0.16/0.37 # Ran out of tableaux, making start rules for all clauses % 0.16/0.41 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.16/0.41 # We now have 10 tableaux to operate on % 0.16/0.44 # There were 3 total branch saturation attempts. % 0.16/0.44 # There were 0 of these attempts blocked. % 0.16/0.44 # There were 0 deferred branch saturation attempts. % 0.16/0.44 # There were 0 free duplicated saturations. % 0.16/0.44 # There were 3 total successful branch saturations. % 0.16/0.44 # There were 0 successful branch saturations in interreduction. % 0.16/0.44 # There were 0 successful branch saturations on the branch. % 0.16/0.44 # There were 3 successful branch saturations after the branch. % 0.16/0.44 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.16/0.44 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.16/0.44 # Begin clausification derivation % 0.16/0.44 % 0.16/0.44 # End clausification derivation % 0.16/0.44 # Begin listing active clauses obtained from FOF to CNF conversion % 0.16/0.44 cnf(i_0_4, negated_conjecture, (f(x0,f(x0,x0))!=f(x1,f(x1,x1)))). % 0.16/0.44 cnf(i_0_3, plain, (f(f(f(f(X1,X2),f(X2,X3)),X4),f(X2,f(f(X2,f(f(X1,X1),X1)),X3)))=X2)). % 0.16/0.44 cnf(i_0_6, plain, (X5=X5)). % 0.16/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.16/0.44 # Begin printing tableau % 0.16/0.44 # Found 10 steps % 0.16/0.44 cnf(i_0_4, negated_conjecture, (f(x0,f(x0,x0))!=f(x1,f(x1,x1))), inference(start_rule)). % 0.16/0.44 cnf(i_0_11, plain, (f(x0,f(x0,x0))!=f(x1,f(x1,x1))), inference(extension_rule, [i_0_10])). % 0.16/0.44 cnf(i_0_23, plain, (f(x0,x0)!=f(x1,x1)), inference(extension_rule, [i_0_9])). % 0.16/0.44 cnf(i_0_22, plain, (x0!=x1), inference(etableau_closure_rule, [i_0_22, ...])). % 0.16/0.44 cnf(i_0_6486, plain, (f(x0,f(f(f(f(X1,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X1,X1),X1)),x0))))!=f(x0,x0)), inference(extension_rule, [i_0_10])). % 0.16/0.44 cnf(i_0_12794, plain, (x0!=f(f(f(f(X1,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X1,X1),X1)),x0)))), inference(closure_rule, [i_0_3])). % 0.16/0.44 cnf(i_0_6487, plain, (f(x0,f(f(f(f(X1,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X1,X1),X1)),x0))))!=f(x1,x1)), inference(extension_rule, [i_0_9])). % 0.16/0.44 cnf(i_0_12793, plain, ($false), inference(closure_rule, [i_0_6])). % 0.16/0.44 cnf(i_0_12810, plain, (f(x0,f(f(f(f(X1,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X1,X1),X1)),x0))))!=f(f(f(f(X1,f(x0,f(f(f(f(X1,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X1,X1),X1)),x0))))),f(f(x0,f(f(f(f(X1,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X1,X1),X1)),x0)))),X3)),X4),f(f(x0,f(f(f(f(X1,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X1,X1),X1)),x0)))),f(f(f(x0,f(f(f(f(X1,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X1,X1),X1)),x0)))),f(f(X1,X1),X1)),X3)))), inference(closure_rule, [i_0_3])). % 0.16/0.44 cnf(i_0_12811, plain, (f(f(f(f(X1,f(x0,f(f(f(f(X1,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X1,X1),X1)),x0))))),f(f(x0,f(f(f(f(X1,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X1,X1),X1)),x0)))),X3)),X4),f(f(x0,f(f(f(f(X1,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X1,X1),X1)),x0)))),f(f(f(x0,f(f(f(f(X1,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X1,X1),X1)),x0)))),f(f(X1,X1),X1)),X3)))!=f(x1,x1)), inference(etableau_closure_rule, [i_0_12811, ...])). % 0.16/0.44 # End printing tableau % 0.16/0.44 # SZS output end % 0.16/0.44 # Branches closed with saturation will be marked with an "s" % 0.16/0.44 # Child (27801) has found a proof. % 0.16/0.44 % 0.16/0.44 # Proof search is over... % 0.16/0.44 # Freeing feature tree %------------------------------------------------------------------------------