TSTP Solution File: LCL433-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL433-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:12:43 EDT 2023
% Result : Unsatisfiable 20.57s 3.30s
% Output : CNFRefutation 20.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 7 unt; 0 nHn; 18 RR)
% Number of literals : 42 ( 0 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 55 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_PropLog_Othms_OMP_0,axiom,
( c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.pOeaTUsHgV/E---3.1_19157.p',cls_PropLog_Othms_OMP_0) ).
cnf(cls_PropLog_Oweaken__left__insert_0,axiom,
( c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.pOeaTUsHgV/E---3.1_19157.p',cls_PropLog_Oweaken__left__insert_0) ).
cnf(cls_PropLog_Othms_OH_0,axiom,
( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.pOeaTUsHgV/E---3.1_19157.p',cls_PropLog_Othms_OH_0) ).
cnf(cls_conjecture_4,negated_conjecture,
( c_in(X1,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Osat(v_F,X1,t_a) ),
file('/export/starexec/sandbox2/tmp/tmp.pOeaTUsHgV/E---3.1_19157.p',cls_conjecture_4) ).
cnf(cls_PropLog_Osat__imp_0,axiom,
( c_PropLog_Osat(X2,c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X3)
| ~ c_PropLog_Osat(c_insert(X1,X2,tc_PropLog_Opl(X3)),X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.pOeaTUsHgV/E---3.1_19157.p',cls_PropLog_Osat__imp_0) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox2/tmp/tmp.pOeaTUsHgV/E---3.1_19157.p',cls_Set_OinsertCI_1) ).
cnf(cls_conjecture_2,negated_conjecture,
c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a),
file('/export/starexec/sandbox2/tmp/tmp.pOeaTUsHgV/E---3.1_19157.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/tmp/tmp.pOeaTUsHgV/E---3.1_19157.p',cls_conjecture_3) ).
cnf(c_0_8,axiom,
( c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
cls_PropLog_Othms_OMP_0 ).
cnf(c_0_9,axiom,
( c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
cls_PropLog_Oweaken__left__insert_0 ).
cnf(c_0_10,plain,
( c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| ~ c_in(X5,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X5,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
cls_PropLog_Othms_OH_0 ).
cnf(c_0_12,negated_conjecture,
( c_in(X1,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Osat(v_F,X1,t_a) ),
cls_conjecture_4 ).
cnf(c_0_13,axiom,
( c_PropLog_Osat(X2,c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X3)
| ~ c_PropLog_Osat(c_insert(X1,X2,tc_PropLog_Opl(X3)),X4,X3) ),
cls_PropLog_Osat__imp_0 ).
cnf(c_0_14,plain,
( c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X5,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4))
| ~ c_in(X5,c_insert(X2,X3,tc_PropLog_Opl(X4)),tc_PropLog_Opl(X4)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( c_in(c_PropLog_Opl_Oop_A_N_62(X1,X2,t_a),c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Osat(c_insert(X1,v_F,tc_PropLog_Opl(t_a)),X2,t_a) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( c_in(X1,c_PropLog_Othms(c_insert(X2,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Osat(c_insert(X3,v_F,tc_PropLog_Opl(t_a)),X1,t_a)
| ~ c_in(X3,c_insert(X2,v_F,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_18,negated_conjecture,
( c_in(X1,c_PropLog_Othms(c_insert(X2,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Osat(c_insert(X2,v_F,tc_PropLog_Opl(t_a)),X1,t_a) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a),
cls_conjecture_2 ).
cnf(c_0_20,negated_conjecture,
~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
cls_conjecture_3 ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.19 % Problem : LCL433-1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.20 % Command : run_E %s %d THM
% 0.19/0.40 % Computer : n013.cluster.edu
% 0.19/0.40 % Model : x86_64 x86_64
% 0.19/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.40 % Memory : 8042.1875MB
% 0.19/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.40 % CPULimit : 2400
% 0.19/0.40 % WCLimit : 300
% 0.19/0.40 % DateTime : Mon Oct 2 12:30:59 EDT 2023
% 0.19/0.40 % CPUTime :
% 0.25/0.61 Running first-order theorem proving
% 0.25/0.61 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.pOeaTUsHgV/E---3.1_19157.p
% 20.57/3.30 # Version: 3.1pre001
% 20.57/3.30 # Preprocessing class: FMLMSMSMSSSNFFN.
% 20.57/3.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.57/3.30 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 20.57/3.30 # Starting new_bool_3 with 300s (1) cores
% 20.57/3.30 # Starting new_bool_1 with 300s (1) cores
% 20.57/3.30 # Starting sh5l with 300s (1) cores
% 20.57/3.30 # new_bool_3 with pid 19243 completed with status 0
% 20.57/3.30 # Result found by new_bool_3
% 20.57/3.30 # Preprocessing class: FMLMSMSMSSSNFFN.
% 20.57/3.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.57/3.30 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 20.57/3.30 # Starting new_bool_3 with 300s (1) cores
% 20.57/3.30 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 20.57/3.30 # Search class: FGHSM-FFMS32-MFFFFFNN
% 20.57/3.30 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 20.57/3.30 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 20.57/3.30 # SAT001_MinMin_p005000_rr_RG with pid 19246 completed with status 0
% 20.57/3.30 # Result found by SAT001_MinMin_p005000_rr_RG
% 20.57/3.30 # Preprocessing class: FMLMSMSMSSSNFFN.
% 20.57/3.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.57/3.30 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 20.57/3.30 # Starting new_bool_3 with 300s (1) cores
% 20.57/3.30 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 20.57/3.30 # Search class: FGHSM-FFMS32-MFFFFFNN
% 20.57/3.30 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 20.57/3.30 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 20.57/3.30 # Preprocessing time : 0.003 s
% 20.57/3.30 # Presaturation interreduction done
% 20.57/3.30
% 20.57/3.30 # Proof found!
% 20.57/3.30 # SZS status Unsatisfiable
% 20.57/3.30 # SZS output start CNFRefutation
% See solution above
% 20.57/3.30 # Parsed axioms : 1378
% 20.57/3.30 # Removed by relevancy pruning/SinE : 1312
% 20.57/3.30 # Initial clauses : 66
% 20.57/3.30 # Removed in clause preprocessing : 0
% 20.57/3.30 # Initial clauses in saturation : 66
% 20.57/3.30 # Processed clauses : 7746
% 20.57/3.30 # ...of these trivial : 60
% 20.57/3.30 # ...subsumed : 4971
% 20.57/3.30 # ...remaining for further processing : 2715
% 20.57/3.30 # Other redundant clauses eliminated : 0
% 20.57/3.30 # Clauses deleted for lack of memory : 0
% 20.57/3.30 # Backward-subsumed : 241
% 20.57/3.30 # Backward-rewritten : 39
% 20.57/3.30 # Generated clauses : 66454
% 20.57/3.30 # ...of the previous two non-redundant : 64689
% 20.57/3.30 # ...aggressively subsumed : 0
% 20.57/3.30 # Contextual simplify-reflections : 0
% 20.57/3.30 # Paramodulations : 66448
% 20.57/3.30 # Factorizations : 0
% 20.57/3.30 # NegExts : 0
% 20.57/3.30 # Equation resolutions : 6
% 20.57/3.30 # Total rewrite steps : 1713
% 20.57/3.30 # Propositional unsat checks : 0
% 20.57/3.30 # Propositional check models : 0
% 20.57/3.30 # Propositional check unsatisfiable : 0
% 20.57/3.30 # Propositional clauses : 0
% 20.57/3.30 # Propositional clauses after purity: 0
% 20.57/3.30 # Propositional unsat core size : 0
% 20.57/3.30 # Propositional preprocessing time : 0.000
% 20.57/3.30 # Propositional encoding time : 0.000
% 20.57/3.30 # Propositional solver time : 0.000
% 20.57/3.30 # Success case prop preproc time : 0.000
% 20.57/3.30 # Success case prop encoding time : 0.000
% 20.57/3.30 # Success case prop solver time : 0.000
% 20.57/3.30 # Current number of processed clauses : 2376
% 20.57/3.30 # Positive orientable unit clauses : 31
% 20.57/3.30 # Positive unorientable unit clauses: 0
% 20.57/3.30 # Negative unit clauses : 13
% 20.57/3.30 # Non-unit-clauses : 2332
% 20.57/3.30 # Current number of unprocessed clauses: 55472
% 20.57/3.30 # ...number of literals in the above : 174514
% 20.57/3.30 # Current number of archived formulas : 0
% 20.57/3.30 # Current number of archived clauses : 339
% 20.57/3.30 # Clause-clause subsumption calls (NU) : 1050900
% 20.57/3.30 # Rec. Clause-clause subsumption calls : 568481
% 20.57/3.30 # Non-unit clause-clause subsumptions : 5092
% 20.57/3.30 # Unit Clause-clause subsumption calls : 1140
% 20.57/3.30 # Rewrite failures with RHS unbound : 0
% 20.57/3.30 # BW rewrite match attempts : 1441
% 20.57/3.30 # BW rewrite match successes : 33
% 20.57/3.30 # Condensation attempts : 0
% 20.57/3.30 # Condensation successes : 0
% 20.57/3.30 # Termbank termtop insertions : 2487551
% 20.57/3.30
% 20.57/3.30 # -------------------------------------------------
% 20.57/3.30 # User time : 2.500 s
% 20.57/3.30 # System time : 0.040 s
% 20.57/3.30 # Total time : 2.540 s
% 20.57/3.30 # Maximum resident set size: 2796 pages
% 20.57/3.30
% 20.57/3.30 # -------------------------------------------------
% 20.57/3.30 # User time : 2.518 s
% 20.57/3.30 # System time : 0.043 s
% 20.57/3.30 # Total time : 2.561 s
% 20.57/3.30 # Maximum resident set size: 2408 pages
% 20.57/3.30 % E---3.1 exiting
% 20.57/3.30 % E---3.1 exiting
%------------------------------------------------------------------------------