TSTP Solution File: LCL433-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL433-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : Mon May 20 23:46:22 EDT 2024
% Result : Unsatisfiable 17.32s 2.71s
% Output : CNFRefutation 17.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 8 unt; 0 nHn; 23 RR)
% Number of literals : 54 ( 0 equ; 29 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 : 71 ( 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/benchmark/theBenchmark.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/benchmark/theBenchmark.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/benchmark/Axioms/LCL005-0.ax',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/benchmark/theBenchmark.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/benchmark/theBenchmark.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/benchmark/Axioms/MSC001-2.ax',cls_Set_OinsertCI_1) ).
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/benchmark/theBenchmark.p',cls_conjecture_3) ).
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/benchmark/theBenchmark.p',cls_conjecture_2) ).
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(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_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(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_9 ).
cnf(c_0_12,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_13,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) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_14,plain,
( 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) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Osat__imp_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(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_11]) ).
cnf(c_0_16,plain,
( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
c_0_12 ).
cnf(c_0_17,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) ),
c_0_13 ).
cnf(c_0_18,plain,
( 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) ),
c_0_14 ).
cnf(c_0_19,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_15,c_0_16]) ).
cnf(c_0_20,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_17,c_0_18]) ).
cnf(c_0_21,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_19,c_0_20]) ).
cnf(c_0_22,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_23,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)),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_24,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_21,c_0_22]) ).
cnf(c_0_25,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_26,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)),
c_0_23 ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : LCL433-1 : TPTP v8.2.0. Released v3.2.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n007.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 02:18:53 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 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/benchmark/theBenchmark.p
% 17.32/2.71 # Version: 3.1.0
% 17.32/2.71 # Preprocessing class: FMLMSMSMSSSNFFN.
% 17.32/2.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.32/2.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.32/2.71 # Starting new_bool_3 with 300s (1) cores
% 17.32/2.71 # Starting new_bool_1 with 300s (1) cores
% 17.32/2.71 # Starting sh5l with 300s (1) cores
% 17.32/2.71 # new_bool_3 with pid 11580 completed with status 0
% 17.32/2.71 # Result found by new_bool_3
% 17.32/2.71 # Preprocessing class: FMLMSMSMSSSNFFN.
% 17.32/2.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.32/2.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.32/2.71 # Starting new_bool_3 with 300s (1) cores
% 17.32/2.71 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 17.32/2.71 # Search class: FGHSM-FFMS32-MFFFFFNN
% 17.32/2.71 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 17.32/2.71 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 17.32/2.71 # SAT001_MinMin_p005000_rr_RG with pid 11584 completed with status 0
% 17.32/2.71 # Result found by SAT001_MinMin_p005000_rr_RG
% 17.32/2.71 # Preprocessing class: FMLMSMSMSSSNFFN.
% 17.32/2.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.32/2.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.32/2.71 # Starting new_bool_3 with 300s (1) cores
% 17.32/2.71 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 17.32/2.71 # Search class: FGHSM-FFMS32-MFFFFFNN
% 17.32/2.71 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 17.32/2.71 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 17.32/2.71 # Preprocessing time : 0.003 s
% 17.32/2.71 # Presaturation interreduction done
% 17.32/2.71
% 17.32/2.71 # Proof found!
% 17.32/2.71 # SZS status Unsatisfiable
% 17.32/2.71 # SZS output start CNFRefutation
% See solution above
% 17.32/2.71 # Parsed axioms : 1378
% 17.32/2.71 # Removed by relevancy pruning/SinE : 1312
% 17.32/2.71 # Initial clauses : 66
% 17.32/2.71 # Removed in clause preprocessing : 0
% 17.32/2.71 # Initial clauses in saturation : 66
% 17.32/2.71 # Processed clauses : 7900
% 17.32/2.71 # ...of these trivial : 60
% 17.32/2.71 # ...subsumed : 5062
% 17.32/2.71 # ...remaining for further processing : 2778
% 17.32/2.71 # Other redundant clauses eliminated : 0
% 17.32/2.71 # Clauses deleted for lack of memory : 0
% 17.32/2.71 # Backward-subsumed : 244
% 17.32/2.71 # Backward-rewritten : 39
% 17.32/2.71 # Generated clauses : 68994
% 17.32/2.71 # ...of the previous two non-redundant : 67196
% 17.32/2.71 # ...aggressively subsumed : 0
% 17.32/2.71 # Contextual simplify-reflections : 0
% 17.32/2.71 # Paramodulations : 68988
% 17.32/2.71 # Factorizations : 0
% 17.32/2.71 # NegExts : 0
% 17.32/2.71 # Equation resolutions : 6
% 17.32/2.71 # Disequality decompositions : 0
% 17.32/2.71 # Total rewrite steps : 1753
% 17.32/2.71 # ...of those cached : 1504
% 17.32/2.71 # Propositional unsat checks : 0
% 17.32/2.71 # Propositional check models : 0
% 17.32/2.71 # Propositional check unsatisfiable : 0
% 17.32/2.71 # Propositional clauses : 0
% 17.32/2.71 # Propositional clauses after purity: 0
% 17.32/2.71 # Propositional unsat core size : 0
% 17.32/2.71 # Propositional preprocessing time : 0.000
% 17.32/2.71 # Propositional encoding time : 0.000
% 17.32/2.71 # Propositional solver time : 0.000
% 17.32/2.71 # Success case prop preproc time : 0.000
% 17.32/2.71 # Success case prop encoding time : 0.000
% 17.32/2.71 # Success case prop solver time : 0.000
% 17.32/2.71 # Current number of processed clauses : 2436
% 17.32/2.71 # Positive orientable unit clauses : 31
% 17.32/2.71 # Positive unorientable unit clauses: 0
% 17.32/2.71 # Negative unit clauses : 13
% 17.32/2.71 # Non-unit-clauses : 2392
% 17.32/2.71 # Current number of unprocessed clauses: 57692
% 17.32/2.71 # ...number of literals in the above : 181994
% 17.32/2.71 # Current number of archived formulas : 0
% 17.32/2.71 # Current number of archived clauses : 342
% 17.32/2.71 # Clause-clause subsumption calls (NU) : 1120739
% 17.32/2.71 # Rec. Clause-clause subsumption calls : 587304
% 17.32/2.71 # Non-unit clause-clause subsumptions : 5186
% 17.32/2.71 # Unit Clause-clause subsumption calls : 1203
% 17.32/2.71 # Rewrite failures with RHS unbound : 0
% 17.32/2.71 # BW rewrite match attempts : 1457
% 17.32/2.71 # BW rewrite match successes : 33
% 17.32/2.71 # Condensation attempts : 0
% 17.32/2.71 # Condensation successes : 0
% 17.32/2.71 # Termbank termtop insertions : 2589868
% 17.32/2.71 # Search garbage collected termcells : 2649
% 17.32/2.71
% 17.32/2.71 # -------------------------------------------------
% 17.32/2.71 # User time : 2.042 s
% 17.32/2.71 # System time : 0.038 s
% 17.32/2.71 # Total time : 2.080 s
% 17.32/2.71 # Maximum resident set size: 2852 pages
% 17.32/2.71
% 17.32/2.71 # -------------------------------------------------
% 17.32/2.71 # User time : 2.064 s
% 17.32/2.71 # System time : 0.039 s
% 17.32/2.71 # Total time : 2.103 s
% 17.32/2.71 # Maximum resident set size: 2420 pages
% 17.32/2.71 % E---3.1 exiting
% 17.32/2.71 % E exiting
%------------------------------------------------------------------------------