TSTP Solution File: LCL443-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL443-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : 300s
% DateTime : Sat May 4 08:18:54 EDT 2024
% Result : Unsatisfiable 90.95s 11.96s
% Output : CNFRefutation 90.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 10 unt; 0 nHn; 22 RR)
% Number of literals : 53 ( 0 equ; 28 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 78 ( 5 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.Ol7laXsF5N/E---3.1_13417.p',cls_PropLog_Othms_OMP_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.Ol7laXsF5N/E---3.1_13417.p',cls_PropLog_Othms_OH_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.Ol7laXsF5N/E---3.1_13417.p',cls_PropLog_Oweaken__left__insert_0) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox2/tmp/tmp.Ol7laXsF5N/E---3.1_13417.p',cls_Set_OinsertCI_1) ).
cnf(cls_PropLog_Odeduction_0,axiom,
( c_in(c_PropLog_Opl_Oop_A_N_62(X2,X1,X4),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)) ),
file('/export/starexec/sandbox2/tmp/tmp.Ol7laXsF5N/E---3.1_13417.p',cls_PropLog_Odeduction_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/tmp/tmp.Ol7laXsF5N/E---3.1_13417.p',cls_conjecture_2) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/tmp/tmp.Ol7laXsF5N/E---3.1_13417.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/tmp/tmp.Ol7laXsF5N/E---3.1_13417.p',cls_conjecture_0) ).
cnf(c_0_8,plain,
( 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)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Othms_OMP_0]) ).
cnf(c_0_9,plain,
( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Othms_OH_0]) ).
cnf(c_0_10,plain,
( 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)) ),
c_0_8 ).
cnf(c_0_11,plain,
( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
c_0_9 ).
cnf(c_0_12,plain,
( 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)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Oweaken__left__insert_0]) ).
cnf(c_0_13,plain,
( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X4,X1,X3),X2,tc_PropLog_Opl(X3))
| ~ c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_15,plain,
( 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)) ),
c_0_12 ).
cnf(c_0_16,plain,
( c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,X1,X3),X4,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))
| ~ c_in(X2,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,X1,X3),X4,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( c_in(c_PropLog_Opl_Oop_A_N_62(X2,X1,X4),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)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Odeduction_0]) ).
cnf(c_0_18,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_10,c_0_15]) ).
cnf(c_0_19,plain,
( c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,X1,X3),X4,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))
| ~ c_in(X2,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_21,plain,
( c_in(c_PropLog_Opl_Oop_A_N_62(X2,X1,X4),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_0_17 ).
cnf(c_0_22,plain,
( c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,X3,X4),X5,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X3,X1,X4),c_PropLog_Othms(X5,X4),tc_PropLog_Opl(X4))
| ~ c_in(X2,c_PropLog_Othms(X5,X4),tc_PropLog_Opl(X4)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
c_0_20 ).
cnf(c_0_24,plain,
( c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),X4,X3),c_PropLog_Othms(X5,X3),tc_PropLog_Opl(X3))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X2,X4,X3),c_PropLog_Othms(X5,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X5,X3),tc_PropLog_Opl(X3)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
cls_conjecture_1 ).
cnf(c_0_26,negated_conjecture,
c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
cls_conjecture_0 ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL443-2 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n023.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 : 300
% 0.12/0.33 % DateTime : Fri May 3 09:24:54 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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.Ol7laXsF5N/E---3.1_13417.p
% 90.95/11.96 # Version: 3.1.0
% 90.95/11.96 # Preprocessing class: FSMSSMSSSSSNFFN.
% 90.95/11.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 90.95/11.96 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 90.95/11.96 # Starting new_bool_3 with 300s (1) cores
% 90.95/11.96 # Starting new_bool_1 with 300s (1) cores
% 90.95/11.96 # Starting sh5l with 300s (1) cores
% 90.95/11.96 # sh5l with pid 13500 completed with status 0
% 90.95/11.96 # Result found by sh5l
% 90.95/11.96 # Preprocessing class: FSMSSMSSSSSNFFN.
% 90.95/11.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 90.95/11.96 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 90.95/11.96 # Starting new_bool_3 with 300s (1) cores
% 90.95/11.96 # Starting new_bool_1 with 300s (1) cores
% 90.95/11.96 # Starting sh5l with 300s (1) cores
% 90.95/11.96 # SinE strategy is gf500_gu_R04_F100_L20000
% 90.95/11.96 # Search class: FHUNF-FFSF32-MFFFFFNN
% 90.95/11.96 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 90.95/11.96 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 90.95/11.96 # SAT001_MinMin_p005000_rr_RG with pid 13506 completed with status 0
% 90.95/11.96 # Result found by SAT001_MinMin_p005000_rr_RG
% 90.95/11.96 # Preprocessing class: FSMSSMSSSSSNFFN.
% 90.95/11.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 90.95/11.96 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 90.95/11.96 # Starting new_bool_3 with 300s (1) cores
% 90.95/11.96 # Starting new_bool_1 with 300s (1) cores
% 90.95/11.96 # Starting sh5l with 300s (1) cores
% 90.95/11.96 # SinE strategy is gf500_gu_R04_F100_L20000
% 90.95/11.96 # Search class: FHUNF-FFSF32-MFFFFFNN
% 90.95/11.96 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 90.95/11.96 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 90.95/11.96 # Preprocessing time : 0.001 s
% 90.95/11.96 # Presaturation interreduction done
% 90.95/11.96
% 90.95/11.96 # Proof found!
% 90.95/11.96 # SZS status Unsatisfiable
% 90.95/11.96 # SZS output start CNFRefutation
% See solution above
% 90.95/11.96 # Parsed axioms : 8
% 90.95/11.96 # Removed by relevancy pruning/SinE : 0
% 90.95/11.96 # Initial clauses : 8
% 90.95/11.96 # Removed in clause preprocessing : 0
% 90.95/11.96 # Initial clauses in saturation : 8
% 90.95/11.96 # Processed clauses : 21566
% 90.95/11.96 # ...of these trivial : 1355
% 90.95/11.96 # ...subsumed : 16390
% 90.95/11.96 # ...remaining for further processing : 3821
% 90.95/11.96 # Other redundant clauses eliminated : 0
% 90.95/11.96 # Clauses deleted for lack of memory : 0
% 90.95/11.96 # Backward-subsumed : 253
% 90.95/11.96 # Backward-rewritten : 82
% 90.95/11.96 # Generated clauses : 534890
% 90.95/11.96 # ...of the previous two non-redundant : 510856
% 90.95/11.96 # ...aggressively subsumed : 0
% 90.95/11.96 # Contextual simplify-reflections : 0
% 90.95/11.96 # Paramodulations : 534890
% 90.95/11.96 # Factorizations : 0
% 90.95/11.96 # NegExts : 0
% 90.95/11.96 # Equation resolutions : 0
% 90.95/11.96 # Disequality decompositions : 0
% 90.95/11.96 # Total rewrite steps : 25630
% 90.95/11.96 # ...of those cached : 23499
% 90.95/11.96 # Propositional unsat checks : 0
% 90.95/11.96 # Propositional check models : 0
% 90.95/11.96 # Propositional check unsatisfiable : 0
% 90.95/11.96 # Propositional clauses : 0
% 90.95/11.96 # Propositional clauses after purity: 0
% 90.95/11.96 # Propositional unsat core size : 0
% 90.95/11.96 # Propositional preprocessing time : 0.000
% 90.95/11.96 # Propositional encoding time : 0.000
% 90.95/11.96 # Propositional solver time : 0.000
% 90.95/11.96 # Success case prop preproc time : 0.000
% 90.95/11.96 # Success case prop encoding time : 0.000
% 90.95/11.96 # Success case prop solver time : 0.000
% 90.95/11.96 # Current number of processed clauses : 3478
% 90.95/11.96 # Positive orientable unit clauses : 175
% 90.95/11.96 # Positive unorientable unit clauses: 0
% 90.95/11.96 # Negative unit clauses : 15
% 90.95/11.96 # Non-unit-clauses : 3288
% 90.95/11.96 # Current number of unprocessed clauses: 485961
% 90.95/11.96 # ...number of literals in the above : 1314725
% 90.95/11.96 # Current number of archived formulas : 0
% 90.95/11.96 # Current number of archived clauses : 343
% 90.95/11.96 # Clause-clause subsumption calls (NU) : 1308180
% 90.95/11.96 # Rec. Clause-clause subsumption calls : 1120952
% 90.95/11.96 # Non-unit clause-clause subsumptions : 15510
% 90.95/11.96 # Unit Clause-clause subsumption calls : 8817
% 90.95/11.96 # Rewrite failures with RHS unbound : 0
% 90.95/11.96 # BW rewrite match attempts : 14717
% 90.95/11.96 # BW rewrite match successes : 58
% 90.95/11.96 # Condensation attempts : 0
% 90.95/11.96 # Condensation successes : 0
% 90.95/11.96 # Termbank termtop insertions : 18434873
% 90.95/11.96 # Search garbage collected termcells : 14
% 90.95/11.96
% 90.95/11.96 # -------------------------------------------------
% 90.95/11.96 # User time : 11.140 s
% 90.95/11.96 # System time : 0.286 s
% 90.95/11.96 # Total time : 11.426 s
% 90.95/11.96 # Maximum resident set size: 1600 pages
% 90.95/11.96
% 90.95/11.96 # -------------------------------------------------
% 90.95/11.96 # User time : 11.142 s
% 90.95/11.96 # System time : 0.287 s
% 90.95/11.96 # Total time : 11.429 s
% 90.95/11.96 # Maximum resident set size: 1696 pages
% 90.95/11.96 % E---3.1 exiting
% 91.54/11.97 % E exiting
%------------------------------------------------------------------------------