TSTP Solution File: COL091-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL091-1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 07:29:02 EDT 2024
% Result : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 35 ( 13 unt; 3 nHn; 35 RR)
% Number of literals : 66 ( 16 equ; 35 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 72 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(k1_contractD_c1,negated_conjecture,
( r != comb_app(combK,X1)
| ~ member(pair(p,X1),contract) ),
file('/export/starexec/sandbox2/tmp/tmp.gGd2Zcki8J/E---3.1_30835.p',k1_contractD_c1) ).
cnf(ap_contractE13,axiom,
( member(pair(X2,ap_contractE_sk3q(X1,X2,X3)),contract)
| ~ ap_contractE_c4(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.gGd2Zcki8J/E---3.1_30835.p',ap_contractE13) ).
cnf(ap_contractE15,axiom,
( X3 = comb_app(X1,ap_contractE_sk3q(X1,X2,X3))
| ~ ap_contractE_c4(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.gGd2Zcki8J/E---3.1_30835.p',ap_contractE15) ).
cnf(k_contractE,axiom,
~ member(pair(combK,X1),contract),
file('/export/starexec/sandbox2/tmp/tmp.gGd2Zcki8J/E---3.1_30835.p',k_contractE) ).
cnf(ap_contractE10,axiom,
( member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract)
| ~ ap_contractE_c3(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.gGd2Zcki8J/E---3.1_30835.p',ap_contractE10) ).
cnf(k_app,axiom,
combK != comb_app(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.gGd2Zcki8J/E---3.1_30835.p',k_app) ).
cnf(ap_contractE9,axiom,
( X1 = comb_app(comb_app(combS,ap_contractE_sk1p(X1,X2,X3)),ap_contractE_sk1q(X1,X2,X3))
| ~ ap_contractE_c2(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.gGd2Zcki8J/E---3.1_30835.p',ap_contractE9) ).
cnf(ap_contractE1,axiom,
( ap_contractE_c1(X1,X2,X3)
| ap_contractE_c2(X1,X2,X3)
| ap_contractE_c3(X1,X2,X3)
| ap_contractE_c4(X1,X2,X3)
| ~ member(pair(comb_app(X1,X2),X3),contract) ),
file('/export/starexec/sandbox2/tmp/tmp.gGd2Zcki8J/E---3.1_30835.p',ap_contractE1) ).
cnf(ap_contractE4,axiom,
( X1 = comb_app(combK,X3)
| ~ ap_contractE_c1(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.gGd2Zcki8J/E---3.1_30835.p',ap_contractE4) ).
cnf(k1_contractD_h1,hypothesis,
member(pair(comb_app(combK,p),r),contract),
file('/export/starexec/sandbox2/tmp/tmp.gGd2Zcki8J/E---3.1_30835.p',k1_contractD_h1) ).
cnf(c_0_10,negated_conjecture,
( r != comb_app(combK,X1)
| ~ member(pair(p,X1),contract) ),
inference(fof_simplification,[status(thm)],[k1_contractD_c1]) ).
cnf(c_0_11,plain,
( member(pair(X2,ap_contractE_sk3q(X1,X2,X3)),contract)
| ~ ap_contractE_c4(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_contractE13]) ).
cnf(c_0_12,negated_conjecture,
( r != comb_app(combK,X1)
| ~ member(pair(p,X1),contract) ),
c_0_10 ).
cnf(c_0_13,plain,
( member(pair(X2,ap_contractE_sk3q(X1,X2,X3)),contract)
| ~ ap_contractE_c4(X1,X2,X3) ),
c_0_11 ).
cnf(c_0_14,plain,
( X3 = comb_app(X1,ap_contractE_sk3q(X1,X2,X3))
| ~ ap_contractE_c4(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_contractE15]) ).
cnf(c_0_15,plain,
~ member(pair(combK,X1),contract),
inference(fof_simplification,[status(thm)],[k_contractE]) ).
cnf(c_0_16,plain,
( member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract)
| ~ ap_contractE_c3(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_contractE10]) ).
cnf(c_0_17,plain,
combK != comb_app(X1,X2),
inference(fof_simplification,[status(thm)],[k_app]) ).
cnf(c_0_18,plain,
( X1 = comb_app(comb_app(combS,ap_contractE_sk1p(X1,X2,X3)),ap_contractE_sk1q(X1,X2,X3))
| ~ ap_contractE_c2(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_contractE9]) ).
cnf(c_0_19,plain,
( ap_contractE_c1(X1,X2,X3)
| ap_contractE_c2(X1,X2,X3)
| ap_contractE_c3(X1,X2,X3)
| ap_contractE_c4(X1,X2,X3)
| ~ member(pair(comb_app(X1,X2),X3),contract) ),
inference(fof_simplification,[status(thm)],[ap_contractE1]) ).
cnf(c_0_20,negated_conjecture,
( comb_app(combK,ap_contractE_sk3q(X1,p,X2)) != r
| ~ ap_contractE_c4(X1,p,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,plain,
( X3 = comb_app(X1,ap_contractE_sk3q(X1,X2,X3))
| ~ ap_contractE_c4(X1,X2,X3) ),
c_0_14 ).
cnf(c_0_22,plain,
~ member(pair(combK,X1),contract),
c_0_15 ).
cnf(c_0_23,plain,
( member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract)
| ~ ap_contractE_c3(X1,X2,X3) ),
c_0_16 ).
cnf(c_0_24,plain,
combK != comb_app(X1,X2),
c_0_17 ).
cnf(c_0_25,plain,
( X1 = comb_app(comb_app(combS,ap_contractE_sk1p(X1,X2,X3)),ap_contractE_sk1q(X1,X2,X3))
| ~ ap_contractE_c2(X1,X2,X3) ),
c_0_18 ).
cnf(c_0_26,plain,
( X1 = comb_app(combK,X3)
| ~ ap_contractE_c1(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_contractE4]) ).
cnf(c_0_27,plain,
( ap_contractE_c1(X1,X2,X3)
| ap_contractE_c2(X1,X2,X3)
| ap_contractE_c3(X1,X2,X3)
| ap_contractE_c4(X1,X2,X3)
| ~ member(pair(comb_app(X1,X2),X3),contract) ),
c_0_19 ).
cnf(c_0_28,hypothesis,
member(pair(comb_app(combK,p),r),contract),
k1_contractD_h1 ).
cnf(c_0_29,negated_conjecture,
~ ap_contractE_c4(combK,p,r),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_30,plain,
~ ap_contractE_c3(combK,X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
~ ap_contractE_c2(combK,X1,X2),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_32,plain,
( X1 = comb_app(combK,X3)
| ~ ap_contractE_c1(X1,X2,X3) ),
c_0_26 ).
cnf(c_0_33,hypothesis,
ap_contractE_c1(combK,p,r),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30]),c_0_31]) ).
cnf(c_0_34,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL091-1 : TPTP v8.1.2. Released v2.7.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 11:55:33 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.gGd2Zcki8J/E---3.1_30835.p
% 0.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # sh5l with pid 30986 completed with status 0
% 0.20/0.50 # Result found by sh5l
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50 # Search class: FGHSF-FFMS32-MFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.50 # G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 30993 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50 # Search class: FGHSF-FFMS32-MFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Unsatisfiable
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 33
% 0.20/0.50 # Removed by relevancy pruning/SinE : 1
% 0.20/0.50 # Initial clauses : 32
% 0.20/0.50 # Removed in clause preprocessing : 1
% 0.20/0.50 # Initial clauses in saturation : 31
% 0.20/0.50 # Processed clauses : 84
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 4
% 0.20/0.50 # ...remaining for further processing : 80
% 0.20/0.50 # Other redundant clauses eliminated : 19
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 75
% 0.20/0.50 # ...of the previous two non-redundant : 51
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 2
% 0.20/0.50 # Paramodulations : 54
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 21
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 0
% 0.20/0.50 # ...of those cached : 0
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 49
% 0.20/0.50 # Positive orientable unit clauses : 4
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 16
% 0.20/0.50 # Non-unit-clauses : 29
% 0.20/0.50 # Current number of unprocessed clauses: 27
% 0.20/0.50 # ...number of literals in the above : 92
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 31
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 272
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 229
% 0.20/0.50 # Non-unit clause-clause subsumptions : 6
% 0.20/0.50 # Unit Clause-clause subsumption calls : 127
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 1683
% 0.20/0.50 # Search garbage collected termcells : 64
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.009 s
% 0.20/0.50 # Maximum resident set size: 1732 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.006 s
% 0.20/0.50 # System time : 0.006 s
% 0.20/0.50 # Total time : 0.012 s
% 0.20/0.50 # Maximum resident set size: 1716 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------