TSTP Solution File: LCL442-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL442-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 : n006.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:18 EDT 2022
% Result : Unsatisfiable 0.12s 0.35s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL442-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/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 : n006.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 3 10:07:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 # No SInE strategy applied
% 0.12/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.35 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.35 #
% 0.12/0.35 # Presaturation interreduction done
% 0.12/0.35 # Number of axioms: 12 Number of unprocessed: 12
% 0.12/0.35 # Tableaux proof search.
% 0.12/0.35 # APR header successfully linked.
% 0.12/0.35 # Hello from C++
% 0.12/0.35 # The folding up rule is enabled...
% 0.12/0.35 # Local unification is enabled...
% 0.12/0.35 # Any saturation attempts will use folding labels...
% 0.12/0.35 # 12 beginning clauses after preprocessing and clausification
% 0.12/0.35 # Creating start rules for all 7 conjectures.
% 0.12/0.35 # There are 7 start rule candidates:
% 0.12/0.35 # Found 0 unit axioms.
% 0.12/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.35 # 7 start rule tableaux created.
% 0.12/0.35 # 12 extension rule candidate clauses
% 0.12/0.35 # 0 unit axiom clauses
% 0.12/0.35
% 0.12/0.35 # Requested 8, 32 cores available to the main process.
% 0.12/0.35 # There are not enough tableaux to fork, creating more from the initial 7
% 0.12/0.35 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.35 # We now have 14 tableaux to operate on
% 0.12/0.35 # There were 3 total branch saturation attempts.
% 0.12/0.35 # There were 0 of these attempts blocked.
% 0.12/0.35 # There were 0 deferred branch saturation attempts.
% 0.12/0.35 # There were 0 free duplicated saturations.
% 0.12/0.35 # There were 3 total successful branch saturations.
% 0.12/0.35 # There were 0 successful branch saturations in interreduction.
% 0.12/0.35 # There were 0 successful branch saturations on the branch.
% 0.12/0.35 # There were 3 successful branch saturations after the branch.
% 0.12/0.35 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.35 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.35 # Begin clausification derivation
% 0.12/0.35
% 0.12/0.35 # End clausification derivation
% 0.12/0.35 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.35 cnf(i_0_13, negated_conjecture, (c_in(v_pl1,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))|~c_PropLog_Oeval(v_tt,v_pl1,t_a))).
% 0.12/0.35 cnf(i_0_15, negated_conjecture, (c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))|~c_PropLog_Oeval(v_tt,v_pl2,t_a))).
% 0.12/0.35 cnf(i_0_18, negated_conjecture, (~c_PropLog_Oeval(v_tt,v_pl2,t_a)|~c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)))).
% 0.12/0.35 cnf(i_0_14, negated_conjecture, (c_PropLog_Oeval(v_tt,v_pl1,t_a)|c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)))).
% 0.12/0.35 cnf(i_0_16, negated_conjecture, (c_PropLog_Oeval(v_tt,v_pl2,t_a)|c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)))).
% 0.12/0.35 cnf(i_0_24, plain, (c_in(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))|~c_in(X2,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)))).
% 0.12/0.35 cnf(i_0_17, negated_conjecture, (c_PropLog_Oeval(v_tt,v_pl1,t_a)|~c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)))).
% 0.12/0.35 cnf(i_0_23, plain, (c_in(X1,c_PropLog_Othms(c_union(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))|~c_in(X1,c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)))).
% 0.12/0.35 cnf(i_0_22, plain, (c_in(X1,c_PropLog_Othms(c_union(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))|~c_in(X1,c_PropLog_Othms(X2,X4),tc_PropLog_Opl(X4)))).
% 0.12/0.35 cnf(i_0_20, plain, (c_in(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))|~c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)))).
% 0.12/0.35 cnf(i_0_21, plain, (c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))|~c_in(c_PropLog_Opl_Oop_A_N_62(X2,c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))|~c_in(X1,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)))).
% 0.12/0.35 cnf(i_0_19, negated_conjecture, (c_PropLog_Oeval(v_tt,v_pl2,t_a)|~c_PropLog_Oeval(v_tt,v_pl1,t_a)|~c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)))).
% 0.12/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.35 # Begin printing tableau
% 0.12/0.35 # Found 6 steps
% 0.12/0.35 cnf(i_0_19, negated_conjecture, (c_PropLog_Oeval(v_tt,v_pl2,t_a)|~c_PropLog_Oeval(v_tt,v_pl1,t_a)|~c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))), inference(start_rule)).
% 0.12/0.35 cnf(i_0_27, plain, (~c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))), inference(extension_rule, [i_0_22])).
% 0.12/0.35 cnf(i_0_97, plain, (~c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))), inference(extension_rule, [i_0_24])).
% 0.12/0.35 cnf(i_0_25, plain, (c_PropLog_Oeval(v_tt,v_pl2,t_a)), inference(etableau_closure_rule, [i_0_25, ...])).
% 0.12/0.35 cnf(i_0_26, plain, (~c_PropLog_Oeval(v_tt,v_pl1,t_a)), inference(etableau_closure_rule, [i_0_26, ...])).
% 0.12/0.35 cnf(i_0_119, plain, (~c_in(c_PropLog_Opl_Ofalse,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))), inference(etableau_closure_rule, [i_0_119, ...])).
% 0.12/0.35 # End printing tableau
% 0.12/0.35 # SZS output end
% 0.12/0.35 # Branches closed with saturation will be marked with an "s"
% 0.12/0.35 # Child (12473) has found a proof.
% 0.12/0.35
% 0.12/0.35 # Proof search is over...
% 0.12/0.35 # Freeing feature tree
%------------------------------------------------------------------------------