%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN351-1 : TPTP v8.1.0. Released v1.2.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 : n011.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:10:14 EDT 2022 % Result : Satisfiable 0.20s 0.39s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN351-1 : TPTP v8.1.0. Released v1.2.0. % 0.03/0.13 % 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 : n011.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 : Mon Jul 11 21:38:12 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 7 Number of unprocessed: 7 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 7 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 7 conjectures. % 0.12/0.37 # There are 7 start rule candidates: % 0.12/0.37 # Found 1 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 7 start rule tableaux created. % 0.12/0.37 # 6 extension rule candidate clauses % 0.12/0.37 # 1 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 7 % 0.12/0.37 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 15 tableaux to operate on % 0.20/0.39 # 23932 Satisfiable branch % 0.20/0.39 # 23936 Satisfiable branch % 0.20/0.39 # Satisfiable branch found. % 0.20/0.39 # 23937 Satisfiable branch % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 0 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 0 successful branch saturations after the branch. % 0.20/0.39 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_8, negated_conjecture, (f(a,X1,a,z(X2,X1)))). % 0.20/0.39 cnf(i_0_9, negated_conjecture, (f(a,X1,a,X2)|~f(X1,b,X1,X2))). % 0.20/0.39 cnf(i_0_10, negated_conjecture, (f(X1,b,X1,X2)|~f(a,X1,a,X2))). % 0.20/0.39 cnf(i_0_12, negated_conjecture, (f(a,X1,a,X2)|f(a,X2,X1,X2))). % 0.20/0.39 cnf(i_0_14, negated_conjecture, (~f(a,z(X1,X2),X1,z(X1,X2))|~f(a,X1,a,X2)|~f(a,X2,X1,X2))). % 0.20/0.39 cnf(i_0_11, negated_conjecture, (f(a,z(X1,X2),X1,z(X1,X2))|f(a,X1,a,X2))). % 0.20/0.39 cnf(i_0_13, negated_conjecture, (f(a,z(X1,X2),X1,z(X1,X2))|f(a,X2,X1,X2))). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 4 steps % 0.20/0.39 cnf(i_0_12, negated_conjecture, (f(a,z(a,z(a,a)),a,z(a,z(a,a)))|f(a,z(a,z(a,a)),z(a,z(a,a)),z(a,z(a,a)))), inference(start_rule)). % 0.20/0.39 cnf(i_0_22, plain, (f(a,z(a,z(a,a)),a,z(a,z(a,a)))), inference(extension_rule, [i_0_14])). % 0.20/0.39 cnf(i_0_73, plain, (~f(a,a,a,z(a,a))), inference(closure_rule, [i_0_8])). % 0.20/0.39 cnf(i_0_74, plain, (~f(a,z(a,a),a,z(a,a))), inference(extension_rule, [i_0_13])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # 23933 Satisfiable branch % 0.20/0.39 # Satisfiable branch found. % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 0 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 0 successful branch saturations after the branch. % 0.20/0.39 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_8, negated_conjecture, (f(a,X1,a,z(X2,X1)))). % 0.20/0.39 cnf(i_0_9, negated_conjecture, (f(a,X1,a,X2)|~f(X1,b,X1,X2))). % 0.20/0.39 cnf(i_0_10, negated_conjecture, (f(X1,b,X1,X2)|~f(a,X1,a,X2))). % 0.20/0.39 cnf(i_0_12, negated_conjecture, (f(a,X1,a,X2)|f(a,X2,X1,X2))). % 0.20/0.39 cnf(i_0_14, negated_conjecture, (~f(a,z(X1,X2),X1,z(X1,X2))|~f(a,X1,a,X2)|~f(a,X2,X1,X2))). % 0.20/0.39 cnf(i_0_11, negated_conjecture, (f(a,z(X1,X2),X1,z(X1,X2))|f(a,X1,a,X2))). % 0.20/0.39 cnf(i_0_13, negated_conjecture, (f(a,z(X1,X2),X1,z(X1,X2))|f(a,X2,X1,X2))). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 5 steps % 0.20/0.39 cnf(i_0_13, negated_conjecture, (f(a,z(a,a),a,z(a,a))|f(a,a,a,a)), inference(start_rule)). % 0.20/0.39 cnf(i_0_15, plain, (f(a,z(a,a),a,z(a,a))), inference(extension_rule, [i_0_14])). % 0.20/0.39 cnf(i_0_34, plain, (~f(a,a,a,z(a,a))), inference(closure_rule, [i_0_8])). % 0.20/0.39 cnf(i_0_33, plain, (~f(a,z(a,z(a,a)),a,z(a,z(a,a)))), inference(extension_rule, [i_0_13])). % 0.20/0.39 cnf(i_0_81, plain, (f(a,z(a,z(a,z(a,a))),a,z(a,z(a,z(a,a))))), inference(extension_rule, [i_0_14])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # Satisfiable branch found. % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 0 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 0 successful branch saturations after the branch. % 0.20/0.39 # Child (23932) has found a proof. % 0.20/0.39 % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------