%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT394-1 : 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 : n021.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.61s 0.84s % Output : CNFRefutation 0.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : LAT394-1 : TPTP v8.1.0. Released v5.4.0. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n021.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Tue Jun 28 19:45:41 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 2 Number of unprocessed: 2 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 0.42/0.61 # The folding up rule is enabled... % 0.42/0.61 # Local unification is enabled... % 0.42/0.61 # Any saturation attempts will use folding labels... % 0.42/0.61 # 2 beginning clauses after preprocessing and clausification % 0.42/0.61 # Creating start rules for all 1 conjectures. % 0.42/0.61 # There are 1 start rule candidates: % 0.42/0.61 # Found 2 unit axioms. % 0.42/0.61 # 1 start rule tableaux created. % 0.42/0.61 # 0 extension rule candidate clauses % 0.42/0.61 # 2 unit axiom clauses % 0.42/0.61 % 0.42/0.61 # Requested 8, 32 cores available to the main process. % 0.42/0.61 # There are not enough tableaux to fork, creating more from the initial 1 % 0.42/0.61 # Creating equality axioms % 0.42/0.61 # Ran out of tableaux, making start rules for all clauses % 0.61/0.84 # There were 2 total branch saturation attempts. % 0.61/0.84 # There were 0 of these attempts blocked. % 0.61/0.84 # There were 0 deferred branch saturation attempts. % 0.61/0.84 # There were 0 free duplicated saturations. % 0.61/0.84 # There were 2 total successful branch saturations. % 0.61/0.84 # There were 0 successful branch saturations in interreduction. % 0.61/0.84 # There were 0 successful branch saturations on the branch. % 0.61/0.84 # There were 2 successful branch saturations after the branch. % 0.61/0.84 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.61/0.84 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.61/0.84 # Begin clausification derivation % 0.61/0.84 % 0.61/0.84 # End clausification derivation % 0.61/0.84 # Begin listing active clauses obtained from FOF to CNF conversion % 0.61/0.84 cnf(i_0_6, plain, (f(f(f(f(X1,X2),f(X2,X3)),X4),f(X2,f(f(X2,f(f(X1,X1),X1)),X3)))=X2)). % 0.61/0.84 cnf(i_0_10, negated_conjecture, (f(x0,f(x0,x0))!=f(x1,f(x1,x1)))). % 0.61/0.84 cnf(i_0_12, plain, (X5=X5)). % 0.61/0.84 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.61/0.84 # Begin printing tableau % 0.61/0.84 # Found 6 steps % 0.61/0.84 cnf(i_0_6, plain, (f(f(f(f(X29,f(x1,x1)),f(f(x1,x1),X22)),X23),f(f(x1,x1),f(f(f(x1,x1),f(f(X29,X29),X29)),X22)))=f(x1,x1)), inference(start_rule)). % 0.61/0.84 cnf(i_0_17, plain, (f(f(f(f(X29,f(x1,x1)),f(f(x1,x1),X22)),X23),f(f(x1,x1),f(f(f(x1,x1),f(f(X29,X29),X29)),X22)))=f(x1,x1)), inference(extension_rule, [i_0_16])). % 0.61/0.84 cnf(i_0_28, plain, (f(f(f(f(X28,x1),f(x1,X27)),X26),f(x1,f(f(x1,f(f(X28,X28),X28)),X27)))!=x1), inference(closure_rule, [i_0_6])). % 0.61/0.84 cnf(i_0_27, plain, (f(f(f(f(f(X28,x1),f(x1,X27)),X26),f(x1,f(f(x1,f(f(X28,X28),X28)),X27))),f(f(f(f(X29,f(x1,x1)),f(f(x1,x1),X22)),X23),f(f(x1,x1),f(f(f(x1,x1),f(f(X29,X29),X29)),X22))))=f(x1,f(x1,x1))), inference(extension_rule, [i_0_15])). % 0.61/0.84 cnf(i_0_34, plain, (f(x0,f(x0,x0))=f(x1,f(x1,x1))), inference(closure_rule, [i_0_10])). % 0.61/0.84 cnf(i_0_35, plain, (f(x0,f(x0,x0))!=f(f(f(f(f(X28,x1),f(x1,X27)),X26),f(x1,f(f(x1,f(f(X28,X28),X28)),X27))),f(f(f(f(X29,f(x1,x1)),f(f(x1,x1),X22)),X23),f(f(x1,x1),f(f(f(x1,x1),f(f(X29,X29),X29)),X22))))), inference(etableau_closure_rule, [i_0_35, ...])). % 0.61/0.84 # End printing tableau % 0.61/0.84 # SZS output end % 0.61/0.84 # Branches closed with saturation will be marked with an "s" % 0.61/0.84 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux. % 0.61/0.84 # We now have 6 tableaux to operate on % 0.61/0.84 # Found closed tableau during pool population. % 0.61/0.84 # Proof search is over... % 0.61/0.84 # Freeing feature tree %------------------------------------------------------------------------------