TSTP Solution File: LCL429-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL429-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 : n011.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 : Sun Jul 17 10:22:08 EDT 2022
% Result : Unsatisfiable 0.16s 0.34s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL429-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.31 % Computer : n011.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 600
% 0.12/0.31 % DateTime : Sat Jul 2 11:32:04 EDT 2022
% 0.16/0.31 % CPUTime :
% 0.16/0.34 # No SInE strategy applied
% 0.16/0.34 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.34 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.16/0.34 #
% 0.16/0.34 # Presaturation interreduction done
% 0.16/0.34 # Number of axioms: 8 Number of unprocessed: 8
% 0.16/0.34 # Tableaux proof search.
% 0.16/0.34 # APR header successfully linked.
% 0.16/0.34 # Hello from C++
% 0.16/0.34 # The folding up rule is enabled...
% 0.16/0.34 # Local unification is enabled...
% 0.16/0.34 # Any saturation attempts will use folding labels...
% 0.16/0.34 # 8 beginning clauses after preprocessing and clausification
% 0.16/0.34 # Creating start rules for all 2 conjectures.
% 0.16/0.34 # There are 2 start rule candidates:
% 0.16/0.34 # Found 5 unit axioms.
% 0.16/0.34 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.16/0.34 # 2 start rule tableaux created.
% 0.16/0.34 # 3 extension rule candidate clauses
% 0.16/0.34 # 5 unit axiom clauses
% 0.16/0.34
% 0.16/0.34 # Requested 8, 32 cores available to the main process.
% 0.16/0.34 # There are not enough tableaux to fork, creating more from the initial 2
% 0.16/0.34 # There were 1 total branch saturation attempts.
% 0.16/0.34 # There were 0 of these attempts blocked.
% 0.16/0.34 # There were 0 deferred branch saturation attempts.
% 0.16/0.34 # There were 0 free duplicated saturations.
% 0.16/0.34 # There were 1 total successful branch saturations.
% 0.16/0.34 # There were 0 successful branch saturations in interreduction.
% 0.16/0.34 # There were 0 successful branch saturations on the branch.
% 0.16/0.34 # There were 1 successful branch saturations after the branch.
% 0.16/0.34 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.34 # Begin clausification derivation
% 0.16/0.34
% 0.16/0.34 # End clausification derivation
% 0.16/0.34 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.16/0.34 cnf(i_0_15, negated_conjecture, (c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X1,t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)))).
% 0.16/0.34 cnf(i_0_11, plain, (c_lessequals(c_minus(X1,X2,tc_set(X3)),c_insert(X4,c_minus(X1,c_insert(X4,X2,X3),tc_set(X3)),X3),tc_set(X3)))).
% 0.16/0.34 cnf(i_0_12, plain, (c_lessequals(c_minus(c_insert(X1,c_minus(X2,c_insert(X3,c_emptyset,X4),tc_set(X4)),X4),X5,tc_set(X4)),c_insert(X1,c_minus(X2,c_insert(X3,X5,X4),tc_set(X4)),X4),tc_set(X4)))).
% 0.16/0.34 cnf(i_0_10, plain, (c_lessequals(c_PropLog_Ohyps(X1,c_minus(X2,c_insert(X3,c_emptyset,X4),tc_set(X4)),X4),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X3,X4),c_PropLog_Opl_Ofalse,X4),c_minus(c_PropLog_Ohyps(X1,X2,X4),c_insert(c_PropLog_Opl_Ovar(X3,X4),c_emptyset,tc_PropLog_Opl(X4)),tc_set(tc_PropLog_Opl(X4))),tc_PropLog_Opl(X4)),tc_set(tc_PropLog_Opl(X4))))).
% 0.16/0.34 cnf(i_0_16, negated_conjecture, (~c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Ovar(v_v,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)))).
% 0.16/0.34 cnf(i_0_14, plain, (c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))|~c_lessequals(X4,X2,tc_set(tc_PropLog_Opl(X3)))|~c_in(X1,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)))).
% 0.16/0.34 cnf(i_0_13, plain, (c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))|~c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X4,c_PropLog_Opl_Ofalse,X3),X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))|~c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)))).
% 0.16/0.34 cnf(i_0_9, plain, (c_in(X1,c_PropLog_Othms(c_minus(X2,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4))|~c_lessequals(X5,X2,tc_set(tc_PropLog_Opl(X4)))|~c_in(X1,c_PropLog_Othms(c_minus(X5,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4)))).
% 0.16/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.16/0.34 # Begin printing tableau
% 0.16/0.34 # Found 6 steps
% 0.16/0.34 cnf(i_0_15, negated_conjecture, (c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,c_minus(X11,c_insert(X12,c_emptyset,t_a),tc_set(t_a)),t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a))), inference(start_rule)).
% 0.16/0.34 cnf(i_0_18, plain, (c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,c_minus(X11,c_insert(X12,c_emptyset,t_a),tc_set(t_a)),t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a))), inference(extension_rule, [i_0_9])).
% 0.16/0.34 cnf(i_0_35, plain, (~c_lessequals(c_PropLog_Ohyps(v_p,c_minus(X11,c_insert(X12,c_emptyset,t_a),tc_set(t_a)),t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X12,t_a),c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,X11,t_a),c_insert(c_PropLog_Opl_Ovar(X12,t_a),c_emptyset,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a)))), inference(closure_rule, [i_0_10])).
% 0.16/0.34 cnf(i_0_34, plain, (c_in(v_p,c_PropLog_Othms(c_minus(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X12,t_a),c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,X11,t_a),c_insert(c_PropLog_Opl_Ovar(X12,t_a),c_emptyset,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a))), inference(extension_rule, [i_0_14])).
% 0.16/0.34 cnf(i_0_37, plain, (c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Ovar(v_v,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a))), inference(closure_rule, [i_0_16])).
% 0.16/0.34 cnf(i_0_38, plain, (~c_lessequals(c_minus(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X12,t_a),c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,X11,t_a),c_insert(c_PropLog_Opl_Ovar(X12,t_a),c_emptyset,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),v_F,tc_set(tc_PropLog_Opl(t_a))),c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Ovar(v_v,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_set(tc_PropLog_Opl(t_a)))), inference(etableau_closure_rule, [i_0_38, ...])).
% 0.16/0.34 # End printing tableau
% 0.16/0.34 # SZS output end
% 0.16/0.34 # Branches closed with saturation will be marked with an "s"
% 0.16/0.34 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux.
% 0.16/0.34 # We now have 5 tableaux to operate on
% 0.16/0.34 # Found closed tableau during pool population.
% 0.16/0.34 # Proof search is over...
% 0.16/0.34 # Freeing feature tree
%------------------------------------------------------------------------------