%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET864-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 : n017.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:28 EDT 2022 % Result : Unsatisfiable 0.14s 0.39s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.14 % Problem : SET864-2 : TPTP v8.1.0. Released v3.2.0. % 0.07/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.36 % Computer : n017.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Mon Jul 11 01:47:03 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 6 Number of unprocessed: 6 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 6 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 5 conjectures. % 0.14/0.39 # There are 5 start rule candidates: % 0.14/0.39 # Found 2 unit axioms. % 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.39 # 5 start rule tableaux created. % 0.14/0.39 # 4 extension rule candidate clauses % 0.14/0.39 # 2 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 5 % 0.14/0.39 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 9 tableaux to operate on % 0.14/0.39 # Closed tableau found in foldup close cycle with 1 folds and 1 closures done. % 0.14/0.39 # There were 0 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 0 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 0 successful branch saturations after the branch. % 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_9, negated_conjecture, (c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)))). % 0.14/0.39 cnf(i_0_8, negated_conjecture, (c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))))). % 0.14/0.39 cnf(i_0_12, negated_conjecture, (v_x(X1)!=X1|~c_in(X1,v_S,tc_set(t_a)))). % 0.14/0.39 cnf(i_0_10, negated_conjecture, (c_in(v_x(X1),v_S,tc_set(t_a))|~c_in(X1,v_S,tc_set(t_a)))). % 0.14/0.39 cnf(i_0_11, negated_conjecture, (c_lessequals(X1,v_x(X1),tc_set(t_a))|~c_in(X1,v_S,tc_set(t_a)))). % 0.14/0.39 cnf(i_0_7, plain, (c_Union(X1,X2)=X3|~c_lessequals(c_Union(X1,X2),X3,tc_set(X2))|~c_in(X1,c_Zorn_Omaxchain(X4,X2),tc_set(tc_set(X2)))|~c_in(X3,X4,tc_set(X2)))). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 8 steps % 0.14/0.39 cnf(i_0_12, negated_conjecture, (v_x(c_Union(v_c,t_a))!=c_Union(v_c,t_a)|~c_in(c_Union(v_c,t_a),v_S,tc_set(t_a))), inference(start_rule)). % 0.14/0.39 cnf(i_0_18, plain, (~c_in(c_Union(v_c,t_a),v_S,tc_set(t_a))), inference(closure_rule, [i_0_9])). % 0.14/0.39 cnf(i_0_17, plain, (v_x(c_Union(v_c,t_a))!=c_Union(v_c,t_a)), inference(extension_rule, [i_0_7])). % 0.14/0.39 cnf(i_0_43, plain, (~c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a)))), inference(closure_rule, [i_0_8])). % 0.14/0.39 cnf(i_0_42, plain, (~c_lessequals(c_Union(v_c,t_a),v_x(c_Union(v_c,t_a)),tc_set(t_a))), inference(extension_rule, [i_0_11])). % 0.14/0.39 cnf(i_0_66, plain, (~c_in(c_Union(v_c,t_a),v_S,tc_set(t_a))), inference(closure_rule, [i_0_9])). % 0.14/0.39 cnf(i_0_44, plain, (~c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a))), inference(extension_rule, [i_0_10])). % 0.14/0.39 cnf(i_0_72, plain, (~c_in(c_Union(v_c,t_a),v_S,tc_set(t_a))), inference(closure_rule, [i_0_9])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # Child (13511) has found a proof. % 0.14/0.39 % 0.14/0.39 # Proof search is over... % 0.14/0.39 # Freeing feature tree %------------------------------------------------------------------------------