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