TSTP Solution File: LCL433-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL433-2 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 23:46:23 EDT 2024
% Result : Unsatisfiable 272.17s 136.53s
% Output : CNFRefutation 272.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 9 unt; 0 nHn; 23 RR)
% Number of literals : 53 ( 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 : 69 ( 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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.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/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
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/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OinsertCI_1) ).
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/sandbox/benchmark/theBenchmark.p',cls_PropLog_Osat__imp_0) ).
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/sandbox/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,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_14,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_15,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_16,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_13,c_0_14]) ).
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_15 ).
cnf(c_0_18,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_19,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_in(X3,c_insert(X2,v_F,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Osat(v_F,c_PropLog_Opl_Oop_A_N_62(X3,X1,t_a),t_a) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_21,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_18 ).
cnf(c_0_22,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(v_F,c_PropLog_Opl_Oop_A_N_62(X2,X1,t_a),t_a) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,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_24,negated_conjecture,
~ c_PropLog_Osat(v_F,c_PropLog_Opl_Oop_A_N_62(v_x,v_xa,t_a),t_a),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,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_23 ).
cnf(c_0_26,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_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : LCL433-2 : TPTP v8.2.0. Released v3.2.0.
% 0.04/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n013.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Mon May 20 01:36:23 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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/benchmark/theBenchmark.p
% 272.17/136.53 # Version: 3.1.0
% 272.17/136.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.17/136.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.17/136.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.17/136.53 # Starting new_bool_3 with 300s (1) cores
% 272.17/136.53 # Starting new_bool_1 with 300s (1) cores
% 272.17/136.53 # Starting sh5l with 300s (1) cores
% 272.17/136.53 # new_bool_3 with pid 21778 completed with status 0
% 272.17/136.53 # Result found by new_bool_3
% 272.17/136.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.17/136.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.17/136.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.17/136.53 # Starting new_bool_3 with 300s (1) cores
% 272.17/136.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 272.17/136.53 # Search class: FHUNF-FFSF32-MFFFFFNN
% 272.17/136.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.17/136.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 272.17/136.53 # SAT001_MinMin_p005000_rr_RG with pid 21782 completed with status 0
% 272.17/136.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 272.17/136.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.17/136.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.17/136.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.17/136.53 # Starting new_bool_3 with 300s (1) cores
% 272.17/136.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 272.17/136.53 # Search class: FHUNF-FFSF32-MFFFFFNN
% 272.17/136.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.17/136.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 272.17/136.53 # Preprocessing time : 0.001 s
% 272.17/136.53 # Presaturation interreduction done
% 272.17/136.53
% 272.17/136.53 # Proof found!
% 272.17/136.53 # SZS status Unsatisfiable
% 272.17/136.53 # SZS output start CNFRefutation
% See solution above
% 272.17/136.53 # Parsed axioms : 8
% 272.17/136.53 # Removed by relevancy pruning/SinE : 0
% 272.17/136.53 # Initial clauses : 8
% 272.17/136.53 # Removed in clause preprocessing : 0
% 272.17/136.53 # Initial clauses in saturation : 8
% 272.17/136.53 # Processed clauses : 67
% 272.17/136.53 # ...of these trivial : 0
% 272.17/136.53 # ...subsumed : 3
% 272.17/136.53 # ...remaining for further processing : 64
% 272.17/136.53 # Other redundant clauses eliminated : 0
% 272.17/136.53 # Clauses deleted for lack of memory : 0
% 272.17/136.53 # Backward-subsumed : 0
% 272.17/136.53 # Backward-rewritten : 0
% 272.17/136.53 # Generated clauses : 139
% 272.17/136.53 # ...of the previous two non-redundant : 138
% 272.17/136.53 # ...aggressively subsumed : 0
% 272.17/136.53 # Contextual simplify-reflections : 0
% 272.17/136.53 # Paramodulations : 139
% 272.17/136.53 # Factorizations : 0
% 272.17/136.53 # NegExts : 0
% 272.17/136.53 # Equation resolutions : 0
% 272.17/136.53 # Disequality decompositions : 0
% 272.17/136.53 # Total rewrite steps : 1
% 272.17/136.53 # ...of those cached : 0
% 272.17/136.53 # Propositional unsat checks : 0
% 272.17/136.53 # Propositional check models : 0
% 272.17/136.53 # Propositional check unsatisfiable : 0
% 272.17/136.53 # Propositional clauses : 0
% 272.17/136.53 # Propositional clauses after purity: 0
% 272.17/136.53 # Propositional unsat core size : 0
% 272.17/136.53 # Propositional preprocessing time : 0.000
% 272.17/136.53 # Propositional encoding time : 0.000
% 272.17/136.53 # Propositional solver time : 0.000
% 272.17/136.53 # Success case prop preproc time : 0.000
% 272.17/136.53 # Success case prop encoding time : 0.000
% 272.17/136.53 # Success case prop solver time : 0.000
% 272.17/136.53 # Current number of processed clauses : 56
% 272.17/136.53 # Positive orientable unit clauses : 2
% 272.17/136.53 # Positive unorientable unit clauses: 0
% 272.17/136.53 # Negative unit clauses : 10
% 272.17/136.53 # Non-unit-clauses : 44
% 272.17/136.53 # Current number of unprocessed clauses: 87
% 272.17/136.53 # ...number of literals in the above : 281
% 272.17/136.53 # Current number of archived formulas : 0
% 272.17/136.53 # Current number of archived clauses : 8
% 272.17/136.53 # Clause-clause subsumption calls (NU) : 464
% 272.17/136.53 # Rec. Clause-clause subsumption calls : 456
% 272.17/136.53 # Non-unit clause-clause subsumptions : 2
% 272.17/136.53 # Unit Clause-clause subsumption calls : 75
% 272.17/136.53 # Rewrite failures with RHS unbound : 0
% 272.17/136.53 # BW rewrite match attempts : 0
% 272.17/136.53 # BW rewrite match successes : 0
% 272.17/136.53 # Condensation attempts : 0
% 272.17/136.53 # Condensation successes : 0
% 272.17/136.53 # Termbank termtop insertions : 4516
% 272.17/136.53 # Search garbage collected termcells : 17
% 272.17/136.53
% 272.17/136.53 # -------------------------------------------------
% 272.17/136.53 # User time : 0.006 s
% 272.17/136.53 # System time : 0.000 s
% 272.17/136.53 # Total time : 0.006 s
% 272.17/136.53 # Maximum resident set size: 1608 pages
% 272.17/136.53
% 272.17/136.53 # -------------------------------------------------
% 272.17/136.53 # User time : 0.006 s
% 272.17/136.53 # System time : 0.002 s
% 272.17/136.53 # Total time : 0.008 s
% 272.17/136.53 # Maximum resident set size: 1696 pages
% 272.17/136.53 % E---3.1 exiting
% 272.17/136.54 % E exiting
%------------------------------------------------------------------------------