TSTP Solution File: LCL429-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL429-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:24:50 EDT 2023
% Result : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 15 unt; 0 nHn; 12 RR)
% Number of literals : 39 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-3 aty)
% Number of variables : 69 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_PropLog_ODiff__weaken__left_0,axiom,
( c_in(X1,c_PropLog_Othms(c_minus(X5,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_minus(X2,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4))
| ~ c_lessequals(X2,X5,tc_set(tc_PropLog_Opl(X4))) ),
file('/export/starexec/sandbox/tmp/tmp.W2FEvDA4Tw/E---3.1_16343.p',cls_PropLog_ODiff__weaken__left_0) ).
cnf(cls_conjecture_3,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)),
file('/export/starexec/sandbox/tmp/tmp.W2FEvDA4Tw/E---3.1_16343.p',cls_conjecture_3) ).
cnf(cls_PropLog_Ohyps__Diff_0,axiom,
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))),
file('/export/starexec/sandbox/tmp/tmp.W2FEvDA4Tw/E---3.1_16343.p',cls_PropLog_Ohyps__Diff_0) ).
cnf(cls_PropLog_Oweaken__left_0,axiom,
( c_in(X1,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_lessequals(X2,X4,tc_set(tc_PropLog_Opl(X3))) ),
file('/export/starexec/sandbox/tmp/tmp.W2FEvDA4Tw/E---3.1_16343.p',cls_PropLog_Oweaken__left_0) ).
cnf(cls_PropLog_Oinsert__Diff__subset2_0,axiom,
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)),
file('/export/starexec/sandbox/tmp/tmp.W2FEvDA4Tw/E---3.1_16343.p',cls_PropLog_Oinsert__Diff__subset2_0) ).
cnf(cls_PropLog_Oinsert__Diff__same_0,axiom,
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)),
file('/export/starexec/sandbox/tmp/tmp.W2FEvDA4Tw/E---3.1_16343.p',cls_PropLog_Oinsert__Diff__same_0) ).
cnf(cls_PropLog_Othms__excluded__middle__rule_0,axiom,
( c_in(X1,c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,c_PropLog_Opl_Ofalse,X4),X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4)) ),
file('/export/starexec/sandbox/tmp/tmp.W2FEvDA4Tw/E---3.1_16343.p',cls_PropLog_Othms__excluded__middle__rule_0) ).
cnf(cls_conjecture_5,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)),
file('/export/starexec/sandbox/tmp/tmp.W2FEvDA4Tw/E---3.1_16343.p',cls_conjecture_5) ).
cnf(c_0_8,axiom,
( c_in(X1,c_PropLog_Othms(c_minus(X5,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_minus(X2,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4))
| ~ c_lessequals(X2,X5,tc_set(tc_PropLog_Opl(X4))) ),
cls_PropLog_ODiff__weaken__left_0 ).
cnf(c_0_9,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)),
cls_conjecture_3 ).
cnf(c_0_10,negated_conjecture,
( c_in(v_p,c_PropLog_Othms(c_minus(X1,v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a))
| ~ c_lessequals(c_PropLog_Ohyps(v_p,X2,t_a),X1,tc_set(tc_PropLog_Opl(t_a))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
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))),
cls_PropLog_Ohyps__Diff_0 ).
cnf(c_0_12,axiom,
( c_in(X1,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_lessequals(X2,X4,tc_set(tc_PropLog_Opl(X3))) ),
cls_PropLog_Oweaken__left_0 ).
cnf(c_0_13,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_minus(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X1,t_a),c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,X2,t_a),c_insert(c_PropLog_Opl_Ovar(X1,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(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( c_in(v_p,c_PropLog_Othms(X1,t_a),tc_PropLog_Opl(t_a))
| ~ c_lessequals(c_minus(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X2,t_a),c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,X3,t_a),c_insert(c_PropLog_Opl_Ovar(X2,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))),X1,tc_set(tc_PropLog_Opl(t_a))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
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)),
cls_PropLog_Oinsert__Diff__subset2_0 ).
cnf(c_0_16,negated_conjecture,
( c_in(v_p,c_PropLog_Othms(X1,t_a),tc_PropLog_Opl(t_a))
| ~ c_lessequals(c_minus(c_PropLog_Ohyps(v_p,X2,t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),X1,tc_set(tc_PropLog_Opl(t_a))) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_17,axiom,
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)),
cls_PropLog_Oinsert__Diff__same_0 ).
cnf(c_0_18,axiom,
( c_in(X1,c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,c_PropLog_Opl_Ofalse,X4),X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4)) ),
cls_PropLog_Othms__excluded__middle__rule_0 ).
cnf(c_0_19,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X1,t_a),c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,X2,t_a),c_insert(c_PropLog_Opl_Ovar(X1,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_insert(X1,c_minus(c_PropLog_Ohyps(v_p,X2,t_a),c_insert(X1,v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,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)),
cls_conjecture_5 ).
cnf(c_0_22,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(c_PropLog_Opl_Ovar(X2,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL429-2 : TPTP v8.1.2. Released v3.2.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 11:37:35 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.W2FEvDA4Tw/E---3.1_16343.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_3 with pid 16421 completed with status 0
% 0.20/0.50 # Result found by new_bool_3
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FHUNM-FFMF32-MFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # SAT001_MinMin_p005000_rr_RG with pid 16426 completed with status 0
% 0.20/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FHUNM-FFMF32-MFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Unsatisfiable
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 8
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 8
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 8
% 0.20/0.50 # Processed clauses : 26
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 26
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 1
% 0.20/0.50 # Generated clauses : 14
% 0.20/0.50 # ...of the previous two non-redundant : 12
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 14
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Total rewrite steps : 2
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 17
% 0.20/0.50 # Positive orientable unit clauses : 8
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 0
% 0.20/0.50 # Non-unit-clauses : 9
% 0.20/0.50 # Current number of unprocessed clauses: 2
% 0.20/0.50 # ...number of literals in the above : 3
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 9
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 9
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 9
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 12
% 0.20/0.50 # BW rewrite match successes : 1
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 1486
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.001 s
% 0.20/0.50 # Total time : 0.006 s
% 0.20/0.50 # Maximum resident set size: 1632 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.006 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.010 s
% 0.20/0.50 # Maximum resident set size: 1688 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------