TSTP Solution File: LCL439-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL439-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:52 EDT 2024
% Result : Unsatisfiable 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 8 unt; 0 nHn; 12 RR)
% Number of literals : 45 ( 0 equ; 24 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 : 65 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_PropLog_Othms__notE_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,c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.jiuonDHh1m/E---3.1_1709.p',cls_PropLog_Othms__notE_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/sandbox/tmp/tmp.jiuonDHh1m/E---3.1_1709.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/sandbox/tmp/tmp.jiuonDHh1m/E---3.1_1709.p',cls_PropLog_Othms_OH_0) ).
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/sandbox/tmp/tmp.jiuonDHh1m/E---3.1_1709.p',cls_PropLog_Odeduction_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox/tmp/tmp.jiuonDHh1m/E---3.1_1709.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox/tmp/tmp.jiuonDHh1m/E---3.1_1709.p',cls_conjecture_1) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox/tmp/tmp.jiuonDHh1m/E---3.1_1709.p',cls_Set_OinsertCI_1) ).
cnf(c_0_7,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,c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Othms__notE_0]) ).
cnf(c_0_8,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_9,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,c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
c_0_7 ).
cnf(c_0_10,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_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)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Othms_OH_0]) ).
cnf(c_0_12,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,c_PropLog_Opl_Ofalse,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
c_0_11 ).
cnf(c_0_14,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_15,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,c_PropLog_Opl_Ofalse,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_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
cls_conjecture_0 ).
cnf(c_0_17,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_18,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_14 ).
cnf(c_0_19,negated_conjecture,
( c_in(X1,c_PropLog_Othms(c_insert(X2,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| ~ c_in(v_p,c_insert(X2,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
c_0_17 ).
cnf(c_0_21,negated_conjecture,
( c_in(c_PropLog_Opl_Oop_A_N_62(X1,X2,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))
| ~ c_in(v_p,c_insert(X1,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : LCL439-2 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 08:59:24 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.jiuonDHh1m/E---3.1_1709.p
% 0.15/0.43 # Version: 3.1.0
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # sh5l with pid 1797 completed with status 0
% 0.15/0.43 # Result found by sh5l
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.43 # Search class: FHUNF-FFSF32-MFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.43 # SAT001_MinMin_p005000_rr_RG with pid 1806 completed with status 0
% 0.15/0.43 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.43 # Search class: FHUNF-FFSF32-MFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Unsatisfiable
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 7
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 7
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 7
% 0.15/0.43 # Processed clauses : 177
% 0.15/0.43 # ...of these trivial : 0
% 0.15/0.43 # ...subsumed : 93
% 0.15/0.43 # ...remaining for further processing : 84
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 7
% 0.15/0.43 # Backward-rewritten : 0
% 0.15/0.43 # Generated clauses : 549
% 0.15/0.43 # ...of the previous two non-redundant : 543
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 6
% 0.15/0.43 # Paramodulations : 549
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Disequality decompositions : 0
% 0.15/0.43 # Total rewrite steps : 1
% 0.15/0.43 # ...of those cached : 0
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 70
% 0.15/0.43 # Positive orientable unit clauses : 3
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 8
% 0.15/0.43 # Non-unit-clauses : 59
% 0.15/0.43 # Current number of unprocessed clauses: 356
% 0.15/0.43 # ...number of literals in the above : 1018
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 14
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 1523
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 1520
% 0.15/0.43 # Non-unit clause-clause subsumptions : 102
% 0.15/0.43 # Unit Clause-clause subsumption calls : 32
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 2
% 0.15/0.43 # BW rewrite match successes : 0
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 15491
% 0.15/0.43 # Search garbage collected termcells : 14
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.011 s
% 0.15/0.43 # System time : 0.000 s
% 0.15/0.43 # Total time : 0.011 s
% 0.15/0.43 # Maximum resident set size: 1684 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.012 s
% 0.15/0.43 # System time : 0.002 s
% 0.15/0.43 # Total time : 0.013 s
% 0.15/0.43 # Maximum resident set size: 1692 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------