%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN006-1 : 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 : n004.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 : Thu Jul 21 06:07:08 EDT 2022 % Result : Unsatisfiable 0.14s 0.38s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : SYN006-1 : TPTP v8.1.0. Released v1.0.0. % 0.04/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.35 % Computer : n004.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Tue Jul 12 05:44:37 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.38 # No SInE strategy applied % 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.38 # % 0.14/0.38 # Presaturation interreduction done % 0.14/0.38 # Number of axioms: 7 Number of unprocessed: 7 % 0.14/0.38 # Tableaux proof search. % 0.14/0.38 # APR header successfully linked. % 0.14/0.38 # Hello from C++ % 0.14/0.38 # The folding up rule is enabled... % 0.14/0.38 # Local unification is enabled... % 0.14/0.38 # Any saturation attempts will use folding labels... % 0.14/0.38 # 7 beginning clauses after preprocessing and clausification % 0.14/0.38 # Creating start rules for all 7 conjectures. % 0.14/0.38 # There are 7 start rule candidates: % 0.14/0.38 # Found 4 unit axioms. % 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.38 # 7 start rule tableaux created. % 0.14/0.38 # 3 extension rule candidate clauses % 0.14/0.38 # 4 unit axiom clauses % 0.14/0.38 % 0.14/0.38 # Requested 8, 32 cores available to the main process. % 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 7 % 0.14/0.38 # There were 1 total branch saturation attempts. % 0.14/0.38 # There were 0 of these attempts blocked. % 0.14/0.38 # There were 0 deferred branch saturation attempts. % 0.14/0.38 # There were 0 free duplicated saturations. % 0.14/0.38 # There were 1 total successful branch saturations. % 0.14/0.38 # There were 0 successful branch saturations in interreduction. % 0.14/0.38 # There were 0 successful branch saturations on the branch. % 0.14/0.38 # There were 1 successful branch saturations after the branch. % 0.14/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.38 # Begin clausification derivation % 0.14/0.38 % 0.14/0.38 # End clausification derivation % 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.38 cnf(i_0_9, negated_conjecture, (p1(a,X1))). % 0.14/0.38 cnf(i_0_10, negated_conjecture, (~q2(X1,f(X2)))). % 0.14/0.38 cnf(i_0_12, negated_conjecture, (~q3(X1,g(X2)))). % 0.14/0.38 cnf(i_0_13, negated_conjecture, (~q4(f(f(X1)),f(g(f(X2)))))). % 0.14/0.38 cnf(i_0_14, negated_conjecture, (p2(f(X1),X2)|~q1(X1,f(X2)))). % 0.14/0.38 cnf(i_0_8, negated_conjecture, (q1(f(X1),X2)|~p1(X1,f(X2)))). % 0.14/0.38 cnf(i_0_11, negated_conjecture, (q4(X1,f(X2))|q3(f(X1),X2)|~p2(X1,f(X2)))). % 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.38 # Begin printing tableau % 0.14/0.38 # Found 4 steps % 0.14/0.38 cnf(i_0_9, negated_conjecture, (p1(a,f(f(X5)))), inference(start_rule)). % 0.14/0.38 cnf(i_0_25, plain, (p1(a,f(f(X5)))), inference(extension_rule, [i_0_8])). % 0.14/0.38 cnf(i_0_78, plain, (q1(f(a),f(X5))), inference(extension_rule, [i_0_14])). % 0.14/0.38 cnf(i_0_87, plain, (p2(f(f(a)),X5)), inference(etableau_closure_rule, [i_0_87, ...])). % 0.14/0.38 # End printing tableau % 0.14/0.38 # SZS output end % 0.14/0.38 # Branches closed with saturation will be marked with an "s" % 0.14/0.38 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. % 0.14/0.38 # We now have 7 tableaux to operate on % 0.14/0.38 # Found closed tableau during pool population. % 0.14/0.38 # Proof search is over... % 0.14/0.38 # Freeing feature tree %------------------------------------------------------------------------------