%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN353-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 : 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 : Thu Jul 21 06:10:15 EDT 2022 % Result : Unsatisfiable 9.55s 1.55s % Output : CNFRefutation 9.55s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.10 % Problem : SYN353-1 : TPTP v8.1.0. Released v1.2.0. % 0.09/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.10/0.31 % Computer : n021.cluster.edu % 0.10/0.31 % Model : x86_64 x86_64 % 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.31 % Memory : 8042.1875MB % 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.31 % CPULimit : 300 % 0.10/0.31 % WCLimit : 600 % 0.10/0.31 % DateTime : Tue Jul 12 02:07:23 EDT 2022 % 0.10/0.31 % CPUTime : % 0.16/0.33 # No SInE strategy applied % 0.16/0.33 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.16/0.33 # and selection function SelectComplexExceptUniqMaxHorn. % 0.16/0.33 # % 0.16/0.33 # Presaturation interreduction done % 0.16/0.33 # Number of axioms: 17 Number of unprocessed: 17 % 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.34 # The folding up rule is enabled... % 0.16/0.34 # Local unification is enabled... % 0.16/0.34 # Any saturation attempts will use folding labels... % 0.16/0.34 # 17 beginning clauses after preprocessing and clausification % 0.16/0.34 # Creating start rules for all 17 conjectures. % 0.16/0.34 # There are 17 start rule candidates: % 0.16/0.34 # Found 0 unit axioms. % 0.16/0.34 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.16/0.34 # 17 start rule tableaux created. % 0.16/0.34 # 17 extension rule candidate clauses % 0.16/0.34 # 0 unit axiom clauses % 0.16/0.34 % 0.16/0.34 # Requested 8, 32 cores available to the main process. % 9.55/1.55 # There were 6 total branch saturation attempts. % 9.55/1.55 # There were 0 of these attempts blocked. % 9.55/1.55 # There were 0 deferred branch saturation attempts. % 9.55/1.55 # There were 1 free duplicated saturations. % 9.55/1.55 # There were 6 total successful branch saturations. % 9.55/1.55 # There were 0 successful branch saturations in interreduction. % 9.55/1.55 # There were 0 successful branch saturations on the branch. % 9.55/1.55 # There were 5 successful branch saturations after the branch. % 9.55/1.55 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.55/1.55 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.55/1.55 # Begin clausification derivation % 9.55/1.55 % 9.55/1.55 # End clausification derivation % 9.55/1.55 # Begin listing active clauses obtained from FOF to CNF conversion % 9.55/1.55 cnf(i_0_21, negated_conjecture, (f(X1,X2,z(X2,X1,X3))|f(X3,X2,X1))). % 9.55/1.55 cnf(i_0_30, negated_conjecture, (f(z(X1,X2,X3),X2,X1)|~f(X1,X2,X3))). % 9.55/1.55 cnf(i_0_20, negated_conjecture, (f(X1,X2,X3)|~f(X1,X3,z(X3,X1,X2))|~f(X2,X3,X1))). % 9.55/1.55 cnf(i_0_19, negated_conjecture, (f(X1,X2,X3)|~f(X2,X1,z(X1,X2,X3))|~f(X3,X1,X2))). % 9.55/1.55 cnf(i_0_23, negated_conjecture, (f(X1,X2,X3)|~f(X1,z(X1,X2,X3),X2)|~f(X2,X3,X1))). % 9.55/1.55 cnf(i_0_25, negated_conjecture, (f(X1,z(X1,X2,X3),X2)|f(X2,X3,X1))). % 9.55/1.55 cnf(i_0_22, negated_conjecture, (f(X1,X2,z(X2,X1,X3))|~f(X1,X3,X2)|~f(X2,X1,X3))). % 9.55/1.55 cnf(i_0_24, negated_conjecture, (f(X1,X2,X3)|~f(X2,z(X2,X3,X1),X3)|~f(X3,X1,X2))). % 9.55/1.55 cnf(i_0_28, negated_conjecture, (f(X1,X2,X3)|f(X3,X1,X2)|~f(z(X3,X1,X2),X1,X3))). % 9.55/1.55 cnf(i_0_27, negated_conjecture, (f(X1,X2,X3)|f(X2,X3,X1)|~f(z(X2,X3,X1),X3,X2))). % 9.55/1.55 cnf(i_0_26, negated_conjecture, (f(X1,z(X1,X2,X3),X2)|~f(X3,X1,X2)|~f(X1,X2,X3))). % 9.55/1.55 cnf(i_0_29, negated_conjecture, (f(z(X1,X2,X3),X2,X1)|~f(X2,X3,X1)|~f(X3,X1,X2))). % 9.55/1.55 cnf(i_0_18, negated_conjecture, (f(X1,X2,X3)|f(X2,X3,X1)|~f(a,a,z(X3,X1,X2))|~f(X3,X1,X2))). % 9.55/1.55 cnf(i_0_34, negated_conjecture, (~f(z(X1,X2,X3),z(X1,X2,X3),z(X1,X2,X3))|~f(X3,X1,X2)|~f(X2,X3,X1)|~f(X1,X2,X3))). % 9.55/1.55 cnf(i_0_32, negated_conjecture, (f(z(X1,X2,X3),z(X1,X2,X3),z(X1,X2,X3))|f(X2,X3,X1))). % 9.55/1.55 cnf(i_0_33, negated_conjecture, (f(z(X1,X2,X3),z(X1,X2,X3),z(X1,X2,X3))|f(X3,X1,X2))). % 9.55/1.55 cnf(i_0_31, negated_conjecture, (f(z(X1,X2,X3),z(X1,X2,X3),z(X1,X2,X3))|f(X1,X2,X3))). % 9.55/1.55 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 9.55/1.55 # Begin printing tableau % 9.55/1.55 # Found 19 steps % 9.55/1.55 cnf(i_0_33, negated_conjecture, (f(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))))|f(z(a,a,z(a,a,a)),a,a)), inference(start_rule)). % 9.55/1.55 cnf(i_0_37, plain, (f(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))))), inference(extension_rule, [i_0_34])). % 9.55/1.55 cnf(i_0_90, plain, (~f(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))))), inference(closure_rule, [i_0_37])). % 9.55/1.55 cnf(i_0_91, plain, (~f(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))))), inference(closure_rule, [i_0_37])). % 9.55/1.55 cnf(i_0_88, plain, (~f(z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))))), inference(extension_rule, [i_0_31])). % 9.55/1.55 cnf(i_0_92, plain, (f(z(z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))))),z(z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))))),z(z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))))))), inference(extension_rule, [i_0_29])). % 9.55/1.55 cnf(i_0_104, plain, (~f(z(z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))))),z(z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))))),z(z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))))))), inference(closure_rule, [i_0_92])). % 9.55/1.55 cnf(i_0_38, plain, (f(z(a,a,z(a,a,a)),a,a)), inference(extension_rule, [i_0_28])). % 9.55/1.55 cnf(i_0_44757, plain, (f(a,z(a,a,a),a)), inference(extension_rule, [i_0_23])). % 9.55/1.55 cnf(i_0_64735, plain, (f(a,a,a)), inference(extension_rule, [i_0_29])). % 9.55/1.55 cnf(i_0_64739, plain, (~f(a,a,a)), inference(closure_rule, [i_0_64735])). % 9.55/1.55 cnf(i_0_64737, plain, (~f(a,a,a)), inference(extension_rule, [i_0_21])). % 9.55/1.55 cnf(i_0_44758, plain, (f(a,a,z(a,a,a))), inference(extension_rule, [i_0_18])). % 9.55/1.55 cnf(i_0_102, plain, (f(z(z(z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))))),z(z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))))),z(z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))))),z(z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))))),z(z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a)))),z(z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))),z(a,a,z(a,a,z(a,a,a))))))), inference(etableau_closure_rule, [i_0_102, ...])). % 9.55/1.55 cnf(i_0_64738, plain, (f(z(a,a,a),a,a)), inference(etableau_closure_rule, [i_0_64738, ...])). % 9.55/1.55 cnf(i_0_65473, plain, (f(a,a,z(a,a,a))), inference(etableau_closure_rule, [i_0_65473, ...])). % 9.55/1.55 cnf(i_0_65481, plain, (f(a,a,a)), inference(etableau_closure_rule, [i_0_65481, ...])). % 9.55/1.55 cnf(i_0_65482, plain, (f(a,a,a)), inference(etableau_closure_rule, [i_0_65482, ...])). % 9.55/1.55 cnf(i_0_65484, plain, (~f(a,a,a)), inference(etableau_closure_rule, [i_0_65484, ...])). % 9.55/1.55 # End printing tableau % 9.55/1.55 # SZS output end % 9.55/1.55 # Branches closed with saturation will be marked with an "s" % 9.55/1.55 # Child (27991) has found a proof. % 9.55/1.55 % 9.55/1.55 # Proof search is over... % 9.55/1.55 # Freeing feature tree %------------------------------------------------------------------------------