%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET848-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 : n009.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:14 EDT 2022 % Result : Unsatisfiable 0.19s 0.36s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SET848-2 : TPTP v8.1.0. Released v3.2.0. % 0.12/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 : n009.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 : Sun Jul 10 06:52:22 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.36 # % 0.19/0.36 # Presaturation interreduction done % 0.19/0.36 # Number of axioms: 7 Number of unprocessed: 7 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 0.19/0.36 # The folding up rule is enabled... % 0.19/0.36 # Local unification is enabled... % 0.19/0.36 # Any saturation attempts will use folding labels... % 0.19/0.36 # 7 beginning clauses after preprocessing and clausification % 0.19/0.36 # Creating start rules for all 2 conjectures. % 0.19/0.36 # There are 2 start rule candidates: % 0.19/0.36 # Found 3 unit axioms. % 0.19/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.36 # 2 start rule tableaux created. % 0.19/0.36 # 4 extension rule candidate clauses % 0.19/0.36 # 3 unit axiom clauses % 0.19/0.36 % 0.19/0.36 # Requested 8, 32 cores available to the main process. % 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 2 % 0.19/0.36 # There were 1 total branch saturation attempts. % 0.19/0.36 # There were 0 of these attempts blocked. % 0.19/0.36 # There were 0 deferred branch saturation attempts. % 0.19/0.36 # There were 0 free duplicated saturations. % 0.19/0.36 # There were 1 total successful branch saturations. % 0.19/0.36 # There were 0 successful branch saturations in interreduction. % 0.19/0.36 # There were 0 successful branch saturations on the branch. % 0.19/0.36 # There were 1 successful branch saturations after the branch. % 0.19/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.36 # Begin clausification derivation % 0.19/0.36 % 0.19/0.36 # End clausification derivation % 0.19/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.36 cnf(i_0_9, plain, (c_lessequals(X1,X1,tc_set(X2)))). % 0.19/0.36 cnf(i_0_14, negated_conjecture, (c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a)=c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)))). % 0.19/0.36 cnf(i_0_13, negated_conjecture, (~c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))))). % 0.19/0.36 cnf(i_0_11, plain, (c_in(X1,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))|~c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))))). % 0.19/0.36 cnf(i_0_10, 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.19/0.36 cnf(i_0_8, plain, (c_in(X1,c_minus(X2,X3,tc_set(X4)),X4)|c_in(X1,X3,X4)|~c_in(X1,X2,X4))). % 0.19/0.36 cnf(i_0_12, plain, (c_Zorn_Osucc(X1,X2,X3)!=X2|~c_in(X2,c_minus(c_Zorn_Ochain(X1,X3),c_Zorn_Omaxchain(X1,X3),tc_set(tc_set(tc_set(X3)))),tc_set(tc_set(X3))))). % 0.19/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.36 # Begin printing tableau % 0.19/0.36 # Found 5 steps % 0.19/0.36 cnf(i_0_14, negated_conjecture, (c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a)=c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))), inference(start_rule)). % 0.19/0.36 cnf(i_0_16, plain, (c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a)=c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))), inference(extension_rule, [i_0_12])). % 0.19/0.36 cnf(i_0_34, plain, (~c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_minus(c_Zorn_Ochain(v_S,t_a),c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(tc_set(t_a)))),tc_set(tc_set(t_a)))), inference(extension_rule, [i_0_8])). % 0.19/0.36 cnf(i_0_40, plain, (c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a)))), inference(closure_rule, [i_0_13])). % 0.19/0.36 cnf(i_0_41, plain, (~c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))), inference(etableau_closure_rule, [i_0_41, ...])). % 0.19/0.36 # End printing tableau % 0.19/0.36 # SZS output end % 0.19/0.36 # Branches closed with saturation will be marked with an "s" % 0.19/0.36 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. % 0.19/0.36 # We now have 3 tableaux to operate on % 0.19/0.36 # Found closed tableau during pool population. % 0.19/0.36 # Proof search is over... % 0.19/0.36 # Freeing feature tree %------------------------------------------------------------------------------