%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET837-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 : n016.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:05 EDT 2022 % Result : Unsatisfiable 10.06s 1.86s % Output : CNFRefutation 10.06s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : SET837-2 : TPTP v8.1.0. Released v3.2.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.15/0.36 % Computer : n016.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 600 % 0.15/0.36 % DateTime : Sat Jul 9 17:09:25 EDT 2022 % 0.15/0.36 % CPUTime : % 0.22/0.39 # No SInE strategy applied % 0.22/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.22/0.39 # and selection function SelectCQIPrecWNTNp. % 0.22/0.39 # % 0.22/0.39 # Presaturation interreduction done % 0.22/0.39 # Number of axioms: 13 Number of unprocessed: 13 % 0.22/0.39 # Tableaux proof search. % 0.22/0.39 # APR header successfully linked. % 0.22/0.39 # Hello from C++ % 0.22/0.39 # The folding up rule is enabled... % 0.22/0.39 # Local unification is enabled... % 0.22/0.39 # Any saturation attempts will use folding labels... % 0.22/0.39 # 13 beginning clauses after preprocessing and clausification % 0.22/0.39 # Creating start rules for all 6 conjectures. % 0.22/0.39 # There are 6 start rule candidates: % 0.22/0.39 # Found 0 unit axioms. % 0.22/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.22/0.39 # 6 start rule tableaux created. % 0.22/0.39 # 13 extension rule candidate clauses % 0.22/0.39 # 0 unit axiom clauses % 0.22/0.39 % 0.22/0.39 # Requested 8, 32 cores available to the main process. % 0.22/0.39 # There are not enough tableaux to fork, creating more from the initial 6 % 0.22/0.39 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.22/0.39 # We now have 13 tableaux to operate on % 10.06/1.86 # There were 5 total branch saturation attempts. % 10.06/1.86 # There were 0 of these attempts blocked. % 10.06/1.86 # There were 0 deferred branch saturation attempts. % 10.06/1.86 # There were 0 free duplicated saturations. % 10.06/1.86 # There were 5 total successful branch saturations. % 10.06/1.86 # There were 0 successful branch saturations in interreduction. % 10.06/1.86 # There were 0 successful branch saturations on the branch. % 10.06/1.86 # There were 5 successful branch saturations after the branch. % 10.06/1.86 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.06/1.86 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.06/1.86 # Begin clausification derivation % 10.06/1.86 % 10.06/1.86 # End clausification derivation % 10.06/1.86 # Begin listing active clauses obtained from FOF to CNF conversion % 10.06/1.86 cnf(i_0_14, negated_conjecture, (c_union(v_Y,v_Z,t_a)=v_X|c_lessequals(v_Y,v_X,tc_set(t_a)))). % 10.06/1.86 cnf(i_0_15, negated_conjecture, (c_union(v_Y,v_Z,t_a)=v_X|c_lessequals(v_Z,v_X,tc_set(t_a)))). % 10.06/1.86 cnf(i_0_18, negated_conjecture, (c_union(v_Y,v_Z,t_a)!=v_X|~c_lessequals(v_X,v_x,tc_set(t_a))|~c_lessequals(v_Y,v_X,tc_set(t_a))|~c_lessequals(v_Z,v_X,tc_set(t_a)))). % 10.06/1.86 cnf(i_0_16, negated_conjecture, (c_lessequals(v_Y,v_x,tc_set(t_a))|c_union(v_Y,v_Z,t_a)!=v_X|~c_lessequals(v_Y,v_X,tc_set(t_a))|~c_lessequals(v_Z,v_X,tc_set(t_a)))). % 10.06/1.86 cnf(i_0_17, negated_conjecture, (c_lessequals(v_Z,v_x,tc_set(t_a))|c_union(v_Y,v_Z,t_a)!=v_X|~c_lessequals(v_Y,v_X,tc_set(t_a))|~c_lessequals(v_Z,v_X,tc_set(t_a)))). % 10.06/1.86 cnf(i_0_26, plain, (X1=X2|~c_lessequals(X2,X1,tc_set(X3))|~c_lessequals(X1,X2,tc_set(X3)))). % 10.06/1.86 cnf(i_0_20, plain, (c_in(X1,c_union(X2,X3,X4),X4)|~c_in(X1,X3,X4))). % 10.06/1.86 cnf(i_0_25, plain, (c_lessequals(X1,X2,tc_set(X3))|~c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3))). % 10.06/1.86 cnf(i_0_21, plain, (c_in(X1,c_union(X2,X3,X4),X4)|~c_in(X1,X2,X4))). % 10.06/1.86 cnf(i_0_23, plain, (c_in(X1,X2,X3)|~c_in(X1,X4,X3)|~c_lessequals(X4,X2,tc_set(X3)))). % 10.06/1.86 cnf(i_0_22, plain, (c_in(X1,X2,X3)|c_in(X1,X4,X3)|~c_in(X1,c_union(X2,X4,X3),X3))). % 10.06/1.86 cnf(i_0_19, negated_conjecture, (c_union(v_Y,v_Z,t_a)=v_X|c_lessequals(v_X,X1,tc_set(t_a))|~c_lessequals(v_Y,X1,tc_set(t_a))|~c_lessequals(v_Z,X1,tc_set(t_a)))). % 10.06/1.86 cnf(i_0_24, plain, (c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)|c_lessequals(X1,X2,tc_set(X3)))). % 10.06/1.86 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 10.06/1.86 # Begin printing tableau % 10.06/1.86 # Found 9 steps % 10.06/1.86 cnf(i_0_18, negated_conjecture, (c_union(v_Y,v_Z,t_a)!=v_X|~c_lessequals(v_X,v_x,tc_set(t_a))|~c_lessequals(v_Y,v_X,tc_set(t_a))|~c_lessequals(v_Z,v_X,tc_set(t_a))), inference(start_rule)). % 10.06/1.86 cnf(i_0_39, plain, (c_union(v_Y,v_Z,t_a)!=v_X), inference(extension_rule, [i_0_26])). % 10.06/1.86 cnf(i_0_159, plain, (~c_lessequals(v_X,c_union(v_Y,v_Z,t_a),tc_set(t_a))), inference(extension_rule, [i_0_25])). % 10.06/1.86 cnf(i_0_40, plain, (~c_lessequals(v_X,v_x,tc_set(t_a))), inference(etableau_closure_rule, [i_0_40, ...])). % 10.06/1.86 cnf(i_0_41, plain, (~c_lessequals(v_Y,v_X,tc_set(t_a))), inference(etableau_closure_rule, [i_0_41, ...])). % 10.06/1.86 cnf(i_0_42, plain, (~c_lessequals(v_Z,v_X,tc_set(t_a))), inference(etableau_closure_rule, [i_0_42, ...])). % 10.06/1.86 cnf(i_0_164, plain, (~c_in(c_Main_OsubsetI__1(v_X,c_union(v_Y,v_Z,t_a),t_a),c_union(v_Y,v_Z,t_a),t_a)), inference(extension_rule, [i_0_20])). % 10.06/1.86 cnf(i_0_160, plain, (~c_lessequals(c_union(v_Y,v_Z,t_a),v_X,tc_set(t_a))), inference(etableau_closure_rule, [i_0_160, ...])). % 10.06/1.86 cnf(i_0_58740, plain, (~c_in(c_Main_OsubsetI__1(v_X,c_union(v_Y,v_Z,t_a),t_a),v_Z,t_a)), inference(etableau_closure_rule, [i_0_58740, ...])). % 10.06/1.86 # End printing tableau % 10.06/1.86 # SZS output end % 10.06/1.86 # Branches closed with saturation will be marked with an "s" % 10.06/1.87 # Child (6085) has found a proof. % 10.06/1.87 % 10.06/1.87 # Proof search is over... % 10.06/1.87 # Freeing feature tree %------------------------------------------------------------------------------