%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET857-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 : n014.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:22 EDT 2022 % Result : Unsatisfiable 0.21s 0.41s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : SET857-2 : TPTP v8.1.0. Released v3.2.0. % 0.08/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.35 % Computer : n014.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Sun Jul 10 19:21:35 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 14 Number of unprocessed: 14 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 14 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 6 conjectures. % 0.13/0.38 # There are 6 start rule candidates: % 0.13/0.38 # Found 6 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 6 start rule tableaux created. % 0.13/0.38 # 8 extension rule candidate clauses % 0.13/0.38 # 6 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 6 % 0.13/0.38 # Returning from population with 21 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 21 tableaux to operate on % 0.21/0.41 # There were 1 total branch saturation attempts. % 0.21/0.41 # There were 0 of these attempts blocked. % 0.21/0.41 # There were 0 deferred branch saturation attempts. % 0.21/0.41 # There were 0 free duplicated saturations. % 0.21/0.41 # There were 1 total successful branch saturations. % 0.21/0.41 # There were 0 successful branch saturations in interreduction. % 0.21/0.41 # There were 0 successful branch saturations on the branch. % 0.21/0.41 # There were 1 successful branch saturations after the branch. % 0.21/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.41 # Begin clausification derivation % 0.21/0.41 % 0.21/0.41 # End clausification derivation % 0.21/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.41 cnf(i_0_25, negated_conjecture, (c_in(v_x,v_Y,tc_set(tc_set(t_a))))). % 0.21/0.41 cnf(i_0_24, negated_conjecture, (c_in(v_n,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))))). % 0.21/0.41 cnf(i_0_23, negated_conjecture, (c_lessequals(v_Y,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(tc_set(t_a)))))). % 0.21/0.41 cnf(i_0_18, plain, (c_lessequals(X1,c_Zorn_Osucc(X2,X1,X3),tc_set(tc_set(X3))))). % 0.21/0.41 cnf(i_0_26, negated_conjecture, (~c_lessequals(v_x,v_n,tc_set(tc_set(t_a))))). % 0.21/0.41 cnf(i_0_27, negated_conjecture, (~c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),v_x,tc_set(tc_set(t_a))))). % 0.21/0.41 cnf(i_0_16, plain, (c_lessequals(X1,X2,tc_set(X3))|c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3))). % 0.21/0.41 cnf(i_0_17, plain, (c_lessequals(X1,X2,tc_set(X3))|~c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3))). % 0.21/0.41 cnf(i_0_15, plain, (c_in(X1,X2,X3)|~c_lessequals(X4,X2,tc_set(X3))|~c_in(X1,X4,X3))). % 0.21/0.41 cnf(i_0_28, negated_conjecture, (X1=X2|c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),X2,tc_set(tc_set(t_a)))|~c_lessequals(X1,X2,tc_set(tc_set(t_a)))|~c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))|~c_in(X2,v_Y,tc_set(tc_set(t_a))))). % 0.21/0.41 cnf(i_0_21, plain, (c_lessequals(c_Zorn_Osucc(X1,X2,X3),X4,tc_set(tc_set(X3)))|c_lessequals(X4,X2,tc_set(tc_set(X3)))|c_Zorn_OTFin__linear__lemma1__1(X1,X2,X3)!=X2|~c_in(X4,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X2,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3))))). % 0.21/0.41 cnf(i_0_20, plain, (c_lessequals(c_Zorn_OTFin__linear__lemma1__1(X1,X2,X3),X2,tc_set(tc_set(X3)))|c_lessequals(c_Zorn_Osucc(X1,X2,X3),X4,tc_set(tc_set(X3)))|c_lessequals(X4,X2,tc_set(tc_set(X3)))|~c_in(X4,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X2,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3))))). % 0.21/0.41 cnf(i_0_22, plain, (c_lessequals(c_Zorn_Osucc(X1,X2,X3),X4,tc_set(tc_set(X3)))|c_lessequals(X4,X2,tc_set(tc_set(X3)))|~c_lessequals(c_Zorn_Osucc(X1,c_Zorn_OTFin__linear__lemma1__1(X1,X2,X3),X3),X2,tc_set(tc_set(X3)))|~c_in(X4,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X2,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3))))). % 0.21/0.41 cnf(i_0_19, plain, (c_lessequals(c_Zorn_Osucc(X1,X2,X3),X4,tc_set(tc_set(X3)))|c_lessequals(X4,X2,tc_set(tc_set(X3)))|c_in(c_Zorn_OTFin__linear__lemma1__1(X1,X2,X3),c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X4,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X2,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3))))). % 0.21/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.41 # Begin printing tableau % 0.21/0.41 # Found 6 steps % 0.21/0.41 cnf(i_0_24, negated_conjecture, (c_in(v_n,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))), inference(start_rule)). % 0.21/0.41 cnf(i_0_37, plain, (c_in(v_n,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))), inference(extension_rule, [i_0_15])). % 0.21/0.41 cnf(i_0_140, plain, (~c_lessequals(c_Zorn_OTFin(v_S,t_a),c_Zorn_Osucc(X10,c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),tc_set(tc_set(tc_set(t_a))))), inference(closure_rule, [i_0_18])). % 0.21/0.41 cnf(i_0_139, plain, (c_in(v_n,c_Zorn_Osucc(X10,c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),tc_set(tc_set(t_a)))), inference(extension_rule, [i_0_15])). % 0.21/0.41 cnf(i_0_172, plain, (~c_lessequals(c_Zorn_Osucc(X10,c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_Osucc(X2,c_Zorn_Osucc(X10,c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),tc_set(t_a)),tc_set(tc_set(tc_set(t_a))))), inference(closure_rule, [i_0_18])). % 0.21/0.41 cnf(i_0_171, plain, (c_in(v_n,c_Zorn_Osucc(X2,c_Zorn_Osucc(X10,c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),tc_set(t_a)),tc_set(tc_set(t_a)))), inference(etableau_closure_rule, [i_0_171, ...])). % 0.21/0.41 # End printing tableau % 0.21/0.41 # SZS output end % 0.21/0.41 # Branches closed with saturation will be marked with an "s" % 0.21/0.41 # There were 1 total branch saturation attempts. % 0.21/0.41 # There were 0 of these attempts blocked. % 0.21/0.41 # There were 0 deferred branch saturation attempts. % 0.21/0.41 # There were 0 free duplicated saturations. % 0.21/0.41 # There were 1 total successful branch saturations. % 0.21/0.41 # There were 0 successful branch saturations in interreduction. % 0.21/0.41 # There were 0 successful branch saturations on the branch. % 0.21/0.41 # There were 1 successful branch saturations after the branch. % 0.21/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.41 # Begin clausification derivation % 0.21/0.41 % 0.21/0.41 # End clausification derivation % 0.21/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.41 cnf(i_0_25, negated_conjecture, (c_in(v_x,v_Y,tc_set(tc_set(t_a))))). % 0.21/0.41 cnf(i_0_24, negated_conjecture, (c_in(v_n,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))))). % 0.21/0.41 cnf(i_0_23, negated_conjecture, (c_lessequals(v_Y,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(tc_set(t_a)))))). % 0.21/0.41 cnf(i_0_18, plain, (c_lessequals(X1,c_Zorn_Osucc(X2,X1,X3),tc_set(tc_set(X3))))). % 0.21/0.41 cnf(i_0_26, negated_conjecture, (~c_lessequals(v_x,v_n,tc_set(tc_set(t_a))))). % 0.21/0.41 cnf(i_0_27, negated_conjecture, (~c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),v_x,tc_set(tc_set(t_a))))). % 0.21/0.41 cnf(i_0_16, plain, (c_lessequals(X1,X2,tc_set(X3))|c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3))). % 0.21/0.41 cnf(i_0_17, plain, (c_lessequals(X1,X2,tc_set(X3))|~c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3))). % 0.21/0.41 cnf(i_0_15, plain, (c_in(X1,X2,X3)|~c_lessequals(X4,X2,tc_set(X3))|~c_in(X1,X4,X3))). % 0.21/0.41 cnf(i_0_28, negated_conjecture, (X1=X2|c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),X2,tc_set(tc_set(t_a)))|~c_lessequals(X1,X2,tc_set(tc_set(t_a)))|~c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))|~c_in(X2,v_Y,tc_set(tc_set(t_a))))). % 0.21/0.41 cnf(i_0_21, plain, (c_lessequals(c_Zorn_Osucc(X1,X2,X3),X4,tc_set(tc_set(X3)))|c_lessequals(X4,X2,tc_set(tc_set(X3)))|c_Zorn_OTFin__linear__lemma1__1(X1,X2,X3)!=X2|~c_in(X4,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X2,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3))))). % 0.21/0.41 cnf(i_0_20, plain, (c_lessequals(c_Zorn_OTFin__linear__lemma1__1(X1,X2,X3),X2,tc_set(tc_set(X3)))|c_lessequals(c_Zorn_Osucc(X1,X2,X3),X4,tc_set(tc_set(X3)))|c_lessequals(X4,X2,tc_set(tc_set(X3)))|~c_in(X4,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X2,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3))))). % 0.21/0.41 cnf(i_0_22, plain, (c_lessequals(c_Zorn_Osucc(X1,X2,X3),X4,tc_set(tc_set(X3)))|c_lessequals(X4,X2,tc_set(tc_set(X3)))|~c_lessequals(c_Zorn_Osucc(X1,c_Zorn_OTFin__linear__lemma1__1(X1,X2,X3),X3),X2,tc_set(tc_set(X3)))|~c_in(X4,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X2,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3))))). % 0.21/0.41 cnf(i_0_19, plain, (c_lessequals(c_Zorn_Osucc(X1,X2,X3),X4,tc_set(tc_set(X3)))|c_lessequals(X4,X2,tc_set(tc_set(X3)))|c_in(c_Zorn_OTFin__linear__lemma1__1(X1,X2,X3),c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X4,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X2,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3))))). % 0.21/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.41 # Begin printing tableau % 0.21/0.41 # Found 6 steps % 0.21/0.41 cnf(i_0_25, negated_conjecture, (c_in(v_x,v_Y,tc_set(tc_set(t_a)))), inference(start_rule)). % 0.21/0.41 cnf(i_0_38, plain, (c_in(v_x,v_Y,tc_set(tc_set(t_a)))), inference(extension_rule, [i_0_15])). % 0.21/0.41 cnf(i_0_140, plain, (~c_lessequals(v_Y,c_Zorn_Osucc(X10,v_Y,tc_set(t_a)),tc_set(tc_set(tc_set(t_a))))), inference(closure_rule, [i_0_18])). % 0.21/0.41 cnf(i_0_139, plain, (c_in(v_x,c_Zorn_Osucc(X10,v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))), inference(extension_rule, [i_0_15])). % 0.21/0.41 cnf(i_0_172, plain, (~c_lessequals(c_Zorn_Osucc(X10,v_Y,tc_set(t_a)),c_Zorn_Osucc(X2,c_Zorn_Osucc(X10,v_Y,tc_set(t_a)),tc_set(t_a)),tc_set(tc_set(tc_set(t_a))))), inference(closure_rule, [i_0_18])). % 0.21/0.41 cnf(i_0_171, plain, (c_in(v_x,c_Zorn_Osucc(X2,c_Zorn_Osucc(X10,v_Y,tc_set(t_a)),tc_set(t_a)),tc_set(tc_set(t_a)))), inference(etableau_closure_rule, [i_0_171, ...])). % 0.21/0.41 # End printing tableau % 0.21/0.41 # SZS output end % 0.21/0.41 # Branches closed with saturation will be marked with an "s" % 0.21/0.41 # Child (21125) has found a proof. % 0.21/0.41 % 0.21/0.41 # Proof search is over... % 0.21/0.41 # Freeing feature tree %------------------------------------------------------------------------------