%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COL058-3 : TPTP v8.1.0. Released v1.0.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 : n027.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 : Fri Jul 15 00:24:43 EDT 2022 % Result : Unsatisfiable 0.19s 0.37s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : COL058-3 : TPTP v8.1.0. Released v1.0.0. % 0.04/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 : n027.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 : Tue May 31 15:14:17 EDT 2022 % 0.13/0.34 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic G_E___209_C18_F1_AE_CS_SP_PI_S0Y % 0.19/0.36 # and selection function SelectMaxLComplexAvoidPosPred. % 0.19/0.36 # % 0.19/0.36 # Number of axioms: 2 Number of unprocessed: 2 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 0.19/0.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 2 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 1 conjectures. % 0.19/0.37 # There are 1 start rule candidates: % 0.19/0.37 # Found 2 unit axioms. % 0.19/0.37 # 1 start rule tableaux created. % 0.19/0.37 # 0 extension rule candidate clauses % 0.19/0.37 # 2 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.37 # Creating equality axioms % 0.19/0.37 # Ran out of tableaux, making start rules for all clauses % 0.19/0.37 # There were 2 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 2 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 2 successful branch saturations after the branch. % 0.19/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_3, plain, (response(response(lark,X1),X2)=response(X1,response(X2,X2)))). % 0.19/0.37 cnf(i_0_4, negated_conjecture, (response(response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))))!=response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))))). % 0.19/0.37 cnf(i_0_6, plain, (X3=X3)). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 6 steps % 0.19/0.37 cnf(i_0_3, plain, (response(response(lark,X15),response(lark,X15))=response(X15,response(response(lark,X15),response(lark,X15)))), inference(start_rule)). % 0.19/0.37 cnf(i_0_11, plain, (response(response(lark,X15),response(lark,X15))=response(X15,response(response(lark,X15),response(lark,X15)))), inference(extension_rule, [i_0_10])). % 0.19/0.37 cnf(i_0_22, plain, (response(response(lark,X18),X17)!=response(X18,response(X17,X17))), inference(closure_rule, [i_0_3])). % 0.19/0.37 cnf(i_0_21, plain, (response(response(response(lark,X18),X17),response(response(lark,X15),response(lark,X15)))=response(response(X18,response(X17,X17)),response(X15,response(response(lark,X15),response(lark,X15))))), inference(extension_rule, [i_0_9])). % 0.19/0.37 cnf(i_0_29, plain, (response(response(lark,response(response(lark,X18),X17)),response(lark,X15))!=response(response(response(lark,X18),X17),response(response(lark,X15),response(lark,X15)))), inference(closure_rule, [i_0_3])). % 0.19/0.37 cnf(i_0_28, plain, (response(response(lark,response(response(lark,X18),X17)),response(lark,X15))=response(response(X18,response(X17,X17)),response(X15,response(response(lark,X15),response(lark,X15))))), inference(etableau_closure_rule, [i_0_28, ...])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 7 tableaux to operate on % 0.19/0.37 # Found closed tableau during pool population. % 0.19/0.37 # Proof search is over... % 0.19/0.37 # Freeing feature tree %------------------------------------------------------------------------------