%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET863-2 : TPTP v8.1.0. Released v3.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 : n013.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 : Tue Jul 19 01:03:27 EDT 2022 % Result : Unsatisfiable 0.13s 0.38s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET863-2 : TPTP v8.1.0. Released v3.2.0. % 0.07/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 : n013.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 : Mon Jul 11 07:17:29 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 14 Number of unprocessed: 14 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 14 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 7 conjectures. % 0.13/0.37 # There are 7 start rule candidates: % 0.13/0.37 # Found 6 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 7 start rule tableaux created. % 0.13/0.37 # 8 extension rule candidate clauses % 0.13/0.37 # 6 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 7 % 0.13/0.37 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 15 tableaux to operate on % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 1 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 1 successful branch saturations after the branch. % 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_26, negated_conjecture, (c_in(v_xa,v_x,t_a))). % 0.13/0.38 cnf(i_0_24, negated_conjecture, (c_in(v_x,v_S,tc_set(t_a)))). % 0.13/0.38 cnf(i_0_25, negated_conjecture, (c_lessequals(v_y,v_x,tc_set(t_a)))). % 0.13/0.38 cnf(i_0_23, negated_conjecture, (c_in(v_c,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))))). % 0.13/0.38 cnf(i_0_22, negated_conjecture, (c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))))). % 0.13/0.38 cnf(i_0_27, negated_conjecture, (~c_in(v_xa,v_y,t_a))). % 0.13/0.38 cnf(i_0_28, negated_conjecture, (c_lessequals(X1,v_y,tc_set(t_a))|~c_in(X1,v_c,tc_set(t_a)))). % 0.13/0.38 cnf(i_0_17, plain, (c_lessequals(X1,X2,tc_set(X3))|~c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3))). % 0.13/0.38 cnf(i_0_15, plain, (c_in(X1,X2,X3)|~c_lessequals(X4,X2,tc_set(X3))|~c_in(X1,X4,X3))). % 0.13/0.38 cnf(i_0_16, plain, (c_lessequals(X1,X2,tc_set(X3))|c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3))). % 0.13/0.38 cnf(i_0_21, plain, (c_in(X1,X2,X3)|~c_lessequals(c_Zorn_Omaxchain__super__lemma__1(X4,X2,X3),X2,tc_set(X3))|~c_in(c_union(c_insert(X5,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X6,X3),tc_set(tc_set(X3)))|~c_in(X4,c_Zorn_Omaxchain(X6,X3),tc_set(tc_set(X3)))|~c_in(X1,X5,X3))). % 0.13/0.38 cnf(i_0_18, plain, (c_in(c_union(c_insert(X1,c_emptyset,tc_set(X2)),X3,tc_set(X2)),c_Zorn_Ochain(X4,X2),tc_set(tc_set(X2)))|c_in(c_Zorn_Ochain__extend__1(X3,X1,X2),X3,tc_set(X2))|~c_in(X3,c_Zorn_Ochain(X4,X2),tc_set(tc_set(X2)))|~c_in(X1,X4,tc_set(X2)))). % 0.13/0.38 cnf(i_0_19, plain, (c_in(c_union(c_insert(X1,c_emptyset,tc_set(X2)),X3,tc_set(X2)),c_Zorn_Ochain(X4,X2),tc_set(tc_set(X2)))|~c_lessequals(c_Zorn_Ochain__extend__1(X3,X1,X2),X1,tc_set(X2))|~c_in(X3,c_Zorn_Ochain(X4,X2),tc_set(tc_set(X2)))|~c_in(X1,X4,tc_set(X2)))). % 0.13/0.38 cnf(i_0_20, plain, (c_in(c_Zorn_Omaxchain__super__lemma__1(X1,X2,X3),X1,tc_set(X3))|c_in(X4,X2,X3)|~c_in(c_union(c_insert(X5,c_emptyset,tc_set(X3)),X1,tc_set(X3)),c_Zorn_Ochain(X6,X3),tc_set(tc_set(X3)))|~c_in(X1,c_Zorn_Omaxchain(X6,X3),tc_set(tc_set(X3)))|~c_in(X4,X5,X3))). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 5 steps % 0.13/0.38 cnf(i_0_27, negated_conjecture, (~c_in(v_xa,v_y,t_a)), inference(start_rule)). % 0.13/0.38 cnf(i_0_31, plain, (~c_in(v_xa,v_y,t_a)), inference(extension_rule, [i_0_15])). % 0.13/0.38 cnf(i_0_95, plain, (~c_in(v_xa,v_x,t_a)), inference(closure_rule, [i_0_26])). % 0.13/0.38 cnf(i_0_94, plain, (~c_lessequals(v_x,v_y,tc_set(t_a))), inference(extension_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_97, plain, (~c_in(c_Main_OsubsetI__1(v_x,v_y,t_a),v_y,t_a)), inference(etableau_closure_rule, [i_0_97, ...])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 1 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 1 successful branch saturations after the branch. % 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_26, negated_conjecture, (c_in(v_xa,v_x,t_a))). % 0.13/0.38 cnf(i_0_24, negated_conjecture, (c_in(v_x,v_S,tc_set(t_a)))). % 0.13/0.38 cnf(i_0_25, negated_conjecture, (c_lessequals(v_y,v_x,tc_set(t_a)))). % 0.13/0.38 cnf(i_0_23, negated_conjecture, (c_in(v_c,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))))). % 0.13/0.38 cnf(i_0_22, negated_conjecture, (c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))))). % 0.13/0.38 cnf(i_0_27, negated_conjecture, (~c_in(v_xa,v_y,t_a))). % 0.13/0.38 cnf(i_0_28, negated_conjecture, (c_lessequals(X1,v_y,tc_set(t_a))|~c_in(X1,v_c,tc_set(t_a)))). % 0.13/0.38 cnf(i_0_17, plain, (c_lessequals(X1,X2,tc_set(X3))|~c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3))). % 0.13/0.38 cnf(i_0_15, plain, (c_in(X1,X2,X3)|~c_lessequals(X4,X2,tc_set(X3))|~c_in(X1,X4,X3))). % 0.13/0.38 cnf(i_0_16, plain, (c_lessequals(X1,X2,tc_set(X3))|c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3))). % 0.13/0.38 cnf(i_0_21, plain, (c_in(X1,X2,X3)|~c_lessequals(c_Zorn_Omaxchain__super__lemma__1(X4,X2,X3),X2,tc_set(X3))|~c_in(c_union(c_insert(X5,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X6,X3),tc_set(tc_set(X3)))|~c_in(X4,c_Zorn_Omaxchain(X6,X3),tc_set(tc_set(X3)))|~c_in(X1,X5,X3))). % 0.13/0.38 cnf(i_0_18, plain, (c_in(c_union(c_insert(X1,c_emptyset,tc_set(X2)),X3,tc_set(X2)),c_Zorn_Ochain(X4,X2),tc_set(tc_set(X2)))|c_in(c_Zorn_Ochain__extend__1(X3,X1,X2),X3,tc_set(X2))|~c_in(X3,c_Zorn_Ochain(X4,X2),tc_set(tc_set(X2)))|~c_in(X1,X4,tc_set(X2)))). % 0.13/0.38 cnf(i_0_19, plain, (c_in(c_union(c_insert(X1,c_emptyset,tc_set(X2)),X3,tc_set(X2)),c_Zorn_Ochain(X4,X2),tc_set(tc_set(X2)))|~c_lessequals(c_Zorn_Ochain__extend__1(X3,X1,X2),X1,tc_set(X2))|~c_in(X3,c_Zorn_Ochain(X4,X2),tc_set(tc_set(X2)))|~c_in(X1,X4,tc_set(X2)))). % 0.13/0.38 cnf(i_0_20, plain, (c_in(c_Zorn_Omaxchain__super__lemma__1(X1,X2,X3),X1,tc_set(X3))|c_in(X4,X2,X3)|~c_in(c_union(c_insert(X5,c_emptyset,tc_set(X3)),X1,tc_set(X3)),c_Zorn_Ochain(X6,X3),tc_set(tc_set(X3)))|~c_in(X1,c_Zorn_Omaxchain(X6,X3),tc_set(tc_set(X3)))|~c_in(X4,X5,X3))). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 5 steps % 0.13/0.38 cnf(i_0_26, negated_conjecture, (c_in(v_xa,v_x,t_a)), inference(start_rule)). % 0.13/0.38 cnf(i_0_36, plain, (c_in(v_xa,v_x,t_a)), inference(extension_rule, [i_0_15])). % 0.13/0.38 cnf(i_0_93, plain, (c_in(v_xa,v_y,t_a)), inference(closure_rule, [i_0_27])). % 0.13/0.38 cnf(i_0_94, plain, (~c_lessequals(v_x,v_y,tc_set(t_a))), inference(extension_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_97, plain, (~c_in(c_Main_OsubsetI__1(v_x,v_y,t_a),v_y,t_a)), inference(etableau_closure_rule, [i_0_97, ...])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Child (10447) has found a proof. % 0.13/0.38 % 0.13/0.38 # Proof search is over... % 0.13/0.38 # Freeing feature tree %------------------------------------------------------------------------------