TSTP Solution File: LCL818-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL818-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:34:29 EDT 2024
% Result : Unsatisfiable 0.58s 0.55s
% Output : CNFRefutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 10 unt; 0 nHn; 14 RR)
% Number of literals : 22 ( 2 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-5 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_App_0,axiom,
( c_Type_Otyping(X1,hAPP(hAPP(c_Lambda_OdB_OApp,X2),X3),X4)
| ~ c_Type_Otyping(X1,X3,X5)
| ~ c_Type_Otyping(X1,X2,hAPP(hAPP(c_Type_Otype_OFun,X5),X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.OYL6eGz7qp/E---3.1_19539.p',cls_App_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_Type_Otyping(v_e____,hAPP(hAPP(c_Lambda_OdB_OApp,v_u____),c_Lambda_Osubst(v_a____,v_u____,v_i____)),c_List_Ofoldr(c_Type_Otype_OFun,v_Ts____,v_T_H____,tc_Type_Otype,tc_Type_Otype)),
file('/export/starexec/sandbox2/tmp/tmp.OYL6eGz7qp/E---3.1_19539.p',cls_conjecture_0) ).
cnf(cls_T_0,axiom,
v_T____ = hAPP(hAPP(c_Type_Otype_OFun,v_T_H_H____),c_List_Ofoldr(c_Type_Otype_OFun,v_Ts____,v_T_H____,tc_Type_Otype,tc_Type_Otype)),
file('/export/starexec/sandbox2/tmp/tmp.OYL6eGz7qp/E---3.1_19539.p',cls_T_0) ).
cnf(cls_uT_0,axiom,
c_Type_Otyping(v_e____,v_u____,v_T____),
file('/export/starexec/sandbox2/tmp/tmp.OYL6eGz7qp/E---3.1_19539.p',cls_uT_0) ).
cnf(cls_CHAINED_0,axiom,
c_Type_Otyping(v_e____,c_Lambda_Osubst(v_a____,v_u____,v_i____),v_T_H_H____),
file('/export/starexec/sandbox2/tmp/tmp.OYL6eGz7qp/E---3.1_19539.p',cls_CHAINED_0) ).
cnf(c_0_5,plain,
( c_Type_Otyping(X1,hAPP(hAPP(c_Lambda_OdB_OApp,X2),X3),X4)
| ~ c_Type_Otyping(X1,X3,X5)
| ~ c_Type_Otyping(X1,X2,hAPP(hAPP(c_Type_Otype_OFun,X5),X4)) ),
inference(fof_simplification,[status(thm)],[cls_App_0]) ).
cnf(c_0_6,negated_conjecture,
~ c_Type_Otyping(v_e____,hAPP(hAPP(c_Lambda_OdB_OApp,v_u____),c_Lambda_Osubst(v_a____,v_u____,v_i____)),c_List_Ofoldr(c_Type_Otype_OFun,v_Ts____,v_T_H____,tc_Type_Otype,tc_Type_Otype)),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_7,plain,
( c_Type_Otyping(X1,hAPP(hAPP(c_Lambda_OdB_OApp,X2),X3),X4)
| ~ c_Type_Otyping(X1,X3,X5)
| ~ c_Type_Otyping(X1,X2,hAPP(hAPP(c_Type_Otype_OFun,X5),X4)) ),
c_0_5 ).
cnf(c_0_8,axiom,
v_T____ = hAPP(hAPP(c_Type_Otype_OFun,v_T_H_H____),c_List_Ofoldr(c_Type_Otype_OFun,v_Ts____,v_T_H____,tc_Type_Otype,tc_Type_Otype)),
cls_T_0 ).
cnf(c_0_9,negated_conjecture,
~ c_Type_Otyping(v_e____,hAPP(hAPP(c_Lambda_OdB_OApp,v_u____),c_Lambda_Osubst(v_a____,v_u____,v_i____)),c_List_Ofoldr(c_Type_Otype_OFun,v_Ts____,v_T_H____,tc_Type_Otype,tc_Type_Otype)),
c_0_6 ).
cnf(c_0_10,plain,
( c_Type_Otyping(X1,hAPP(hAPP(c_Lambda_OdB_OApp,X2),X3),c_List_Ofoldr(c_Type_Otype_OFun,v_Ts____,v_T_H____,tc_Type_Otype,tc_Type_Otype))
| ~ c_Type_Otyping(X1,X2,v_T____)
| ~ c_Type_Otyping(X1,X3,v_T_H_H____) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
c_Type_Otyping(v_e____,v_u____,v_T____),
cls_uT_0 ).
cnf(c_0_12,axiom,
c_Type_Otyping(v_e____,c_Lambda_Osubst(v_a____,v_u____,v_i____),v_T_H_H____),
cls_CHAINED_0 ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL818-1 : TPTP v8.1.2. Released v4.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 09:30:07 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.OYL6eGz7qp/E---3.1_19539.p
% 0.58/0.55 # Version: 3.1.0
% 0.58/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.58/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.58/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.58/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.58/0.55 # Starting sh5l with 300s (1) cores
% 0.58/0.55 # new_bool_1 with pid 19618 completed with status 0
% 0.58/0.55 # Result found by new_bool_1
% 0.58/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.58/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.58/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.58/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.58/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.58/0.55 # Search class: FGUSM-FFLM32-MFFFFFNN
% 0.58/0.55 # partial match(1): FGHSM-FFLM32-MFFFFFNN
% 0.58/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.58/0.55 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 181s (1) cores
% 0.58/0.55 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 19621 completed with status 0
% 0.58/0.55 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.58/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.58/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.58/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.58/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.58/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.58/0.55 # Search class: FGUSM-FFLM32-MFFFFFNN
% 0.58/0.55 # partial match(1): FGHSM-FFLM32-MFFFFFNN
% 0.58/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.58/0.55 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 181s (1) cores
% 0.58/0.55 # Preprocessing time : 0.012 s
% 0.58/0.55
% 0.58/0.55 # Proof found!
% 0.58/0.55 # SZS status Unsatisfiable
% 0.58/0.55 # SZS output start CNFRefutation
% See solution above
% 0.58/0.55 # Parsed axioms : 398
% 0.58/0.55 # Removed by relevancy pruning/SinE : 218
% 0.58/0.55 # Initial clauses : 180
% 0.58/0.55 # Removed in clause preprocessing : 0
% 0.58/0.55 # Initial clauses in saturation : 180
% 0.58/0.55 # Processed clauses : 215
% 0.58/0.55 # ...of these trivial : 22
% 0.58/0.55 # ...subsumed : 40
% 0.58/0.55 # ...remaining for further processing : 153
% 0.58/0.55 # Other redundant clauses eliminated : 0
% 0.58/0.55 # Clauses deleted for lack of memory : 0
% 0.58/0.55 # Backward-subsumed : 3
% 0.58/0.55 # Backward-rewritten : 4
% 0.58/0.55 # Generated clauses : 854
% 0.58/0.55 # ...of the previous two non-redundant : 725
% 0.58/0.55 # ...aggressively subsumed : 0
% 0.58/0.55 # Contextual simplify-reflections : 0
% 0.58/0.55 # Paramodulations : 832
% 0.58/0.55 # Factorizations : 2
% 0.58/0.55 # NegExts : 0
% 0.58/0.55 # Equation resolutions : 20
% 0.58/0.55 # Disequality decompositions : 0
% 0.58/0.55 # Total rewrite steps : 179
% 0.58/0.55 # ...of those cached : 86
% 0.58/0.55 # Propositional unsat checks : 0
% 0.58/0.55 # Propositional check models : 0
% 0.58/0.55 # Propositional check unsatisfiable : 0
% 0.58/0.55 # Propositional clauses : 0
% 0.58/0.55 # Propositional clauses after purity: 0
% 0.58/0.55 # Propositional unsat core size : 0
% 0.58/0.55 # Propositional preprocessing time : 0.000
% 0.58/0.55 # Propositional encoding time : 0.000
% 0.58/0.55 # Propositional solver time : 0.000
% 0.58/0.55 # Success case prop preproc time : 0.000
% 0.58/0.55 # Success case prop encoding time : 0.000
% 0.58/0.55 # Success case prop solver time : 0.000
% 0.58/0.55 # Current number of processed clauses : 146
% 0.58/0.55 # Positive orientable unit clauses : 33
% 0.58/0.55 # Positive unorientable unit clauses: 4
% 0.58/0.55 # Negative unit clauses : 18
% 0.58/0.55 # Non-unit-clauses : 91
% 0.58/0.55 # Current number of unprocessed clauses: 685
% 0.58/0.55 # ...number of literals in the above : 1440
% 0.58/0.55 # Current number of archived formulas : 0
% 0.58/0.55 # Current number of archived clauses : 7
% 0.58/0.55 # Clause-clause subsumption calls (NU) : 1319
% 0.58/0.55 # Rec. Clause-clause subsumption calls : 1132
% 0.58/0.55 # Non-unit clause-clause subsumptions : 22
% 0.58/0.55 # Unit Clause-clause subsumption calls : 82
% 0.58/0.55 # Rewrite failures with RHS unbound : 0
% 0.58/0.55 # BW rewrite match attempts : 69
% 0.58/0.55 # BW rewrite match successes : 13
% 0.58/0.55 # Condensation attempts : 0
% 0.58/0.55 # Condensation successes : 0
% 0.58/0.55 # Termbank termtop insertions : 20240
% 0.58/0.55 # Search garbage collected termcells : 1244
% 0.58/0.55
% 0.58/0.55 # -------------------------------------------------
% 0.58/0.55 # User time : 0.030 s
% 0.58/0.55 # System time : 0.011 s
% 0.58/0.55 # Total time : 0.041 s
% 0.58/0.55 # Maximum resident set size: 2332 pages
% 0.58/0.55
% 0.58/0.55 # -------------------------------------------------
% 0.58/0.55 # User time : 0.035 s
% 0.58/0.55 # System time : 0.014 s
% 0.58/0.55 # Total time : 0.049 s
% 0.58/0.55 # Maximum resident set size: 2012 pages
% 0.58/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------