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