TSTP Solution File: COL090-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL090-2 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 33.12s 4.64s
% Output : CNFRefutation 33.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of clauses : 46 ( 22 unt; 4 nHn; 46 RR)
% Number of literals : 81 ( 23 equ; 42 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 : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 92 ( 34 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(k_contractE,axiom,
~ member(pair(combK,X1),contract),
file('/export/starexec/sandbox2/tmp/tmp.gCE2QEMXVN/E---3.1_21429.p',k_contractE) ).
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.gCE2QEMXVN/E---3.1_21429.p',ap_contractE13) ).
cnf(s_contractE,axiom,
~ member(pair(combS,X1),contract),
file('/export/starexec/sandbox2/tmp/tmp.gCE2QEMXVN/E---3.1_21429.p',s_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.gCE2QEMXVN/E---3.1_21429.p',ap_contractE10) ).
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.gCE2QEMXVN/E---3.1_21429.p',ap_contractE1) ).
cnf(s_app,axiom,
combS != comb_app(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.gCE2QEMXVN/E---3.1_21429.p',s_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.gCE2QEMXVN/E---3.1_21429.p',ap_contractE9) ).
cnf(ap_contractE4,axiom,
( X1 = comb_app(combK,X3)
| ~ ap_contractE_c1(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.gCE2QEMXVN/E---3.1_21429.p',ap_contractE4) ).
cnf(app_app1,axiom,
( X1 = X3
| comb_app(X1,X2) != comb_app(X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.gCE2QEMXVN/E---3.1_21429.p',app_app1) ).
cnf(i_contract_E,negated_conjecture,
member(pair(comb_app(comb_app(combS,combK),combK),r),contract),
file('/export/starexec/sandbox2/tmp/tmp.gCE2QEMXVN/E---3.1_21429.p',i_contract_E) ).
cnf(k_s,axiom,
combK != combS,
file('/export/starexec/sandbox2/tmp/tmp.gCE2QEMXVN/E---3.1_21429.p',k_s) ).
cnf(c_0_11,plain,
~ member(pair(combK,X1),contract),
inference(fof_simplification,[status(thm)],[k_contractE]) ).
cnf(c_0_12,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_13,plain,
~ member(pair(combS,X1),contract),
inference(fof_simplification,[status(thm)],[s_contractE]) ).
cnf(c_0_14,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_15,plain,
~ member(pair(combK,X1),contract),
c_0_11 ).
cnf(c_0_16,plain,
( member(pair(X2,ap_contractE_sk3q(X1,X2,X3)),contract)
| ~ ap_contractE_c4(X1,X2,X3) ),
c_0_12 ).
cnf(c_0_17,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_18,plain,
combS != comb_app(X1,X2),
inference(fof_simplification,[status(thm)],[s_app]) ).
cnf(c_0_19,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_20,plain,
~ member(pair(combS,X1),contract),
c_0_13 ).
cnf(c_0_21,plain,
( member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract)
| ~ ap_contractE_c3(X1,X2,X3) ),
c_0_14 ).
cnf(c_0_22,plain,
~ ap_contractE_c4(X1,combK,X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,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_17 ).
cnf(c_0_24,plain,
combS != comb_app(X1,X2),
c_0_18 ).
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_19 ).
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_c3(combS,X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( ap_contractE_c3(X1,combK,X2)
| ap_contractE_c2(X1,combK,X2)
| ap_contractE_c1(X1,combK,X2)
| ~ member(pair(comb_app(X1,combK),X2),contract) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
~ ap_contractE_c2(combS,X1,X2),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_30,plain,
( X1 = X3
| comb_app(X1,X2) != comb_app(X3,X4) ),
inference(fof_simplification,[status(thm)],[app_app1]) ).
cnf(c_0_31,plain,
( X1 = comb_app(combK,X3)
| ~ ap_contractE_c1(X1,X2,X3) ),
c_0_26 ).
cnf(c_0_32,plain,
( ap_contractE_c1(combS,combK,X1)
| ~ member(pair(comb_app(combS,combK),X1),contract) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_33,plain,
( X1 = X3
| comb_app(X1,X2) != comb_app(X3,X4) ),
c_0_30 ).
cnf(c_0_34,plain,
~ member(pair(comb_app(combS,combK),X1),contract),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_24]) ).
cnf(c_0_35,plain,
( comb_app(combS,ap_contractE_sk1p(comb_app(X1,X2),X3,X4)) = X1
| ~ ap_contractE_c2(comb_app(X1,X2),X3,X4) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_25])]) ).
cnf(c_0_36,plain,
~ ap_contractE_c3(comb_app(combS,combK),X1,X2),
inference(spm,[status(thm)],[c_0_34,c_0_21]) ).
cnf(c_0_37,plain,
~ ap_contractE_c2(comb_app(combS,X1),X2,X3),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_35])]) ).
cnf(c_0_38,plain,
( ap_contractE_c1(comb_app(combS,combK),combK,X1)
| ~ member(pair(comb_app(comb_app(combS,combK),combK),X1),contract) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_28]),c_0_37]) ).
cnf(c_0_39,plain,
( comb_app(combS,combK) = comb_app(combK,X1)
| ~ member(pair(comb_app(comb_app(combS,combK),combK),X1),contract) ),
inference(spm,[status(thm)],[c_0_31,c_0_38]) ).
cnf(c_0_40,negated_conjecture,
member(pair(comb_app(comb_app(combS,combK),combK),r),contract),
i_contract_E ).
cnf(c_0_41,negated_conjecture,
comb_app(combS,combK) = comb_app(combK,r),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,plain,
combK != combS,
inference(fof_simplification,[status(thm)],[k_s]) ).
cnf(c_0_43,negated_conjecture,
( combS = X1
| comb_app(combK,r) != comb_app(X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_41]) ).
cnf(c_0_44,plain,
combK != combS,
c_0_42 ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL090-2 : TPTP v8.1.2. Released v2.7.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 11:39:49 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.gCE2QEMXVN/E---3.1_21429.p
% 33.12/4.64 # Version: 3.1.0
% 33.12/4.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 33.12/4.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.12/4.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 33.12/4.64 # Starting new_bool_3 with 300s (1) cores
% 33.12/4.64 # Starting new_bool_1 with 300s (1) cores
% 33.12/4.64 # Starting sh5l with 300s (1) cores
% 33.12/4.64 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 21534 completed with status 0
% 33.12/4.64 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 33.12/4.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 33.12/4.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.12/4.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 33.12/4.64 # No SInE strategy applied
% 33.12/4.64 # Search class: FGHSM-FFLS32-MFFFFFNN
% 33.12/4.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 33.12/4.64 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 33.12/4.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 33.12/4.64 # Starting new_bool_3 with 136s (1) cores
% 33.12/4.64 # Starting new_bool_1 with 136s (1) cores
% 33.12/4.64 # Starting sh5l with 136s (1) cores
% 33.12/4.64 # SAT001_MinMin_p005000_rr_RG with pid 21542 completed with status 0
% 33.12/4.64 # Result found by SAT001_MinMin_p005000_rr_RG
% 33.12/4.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 33.12/4.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.12/4.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 33.12/4.64 # No SInE strategy applied
% 33.12/4.64 # Search class: FGHSM-FFLS32-MFFFFFNN
% 33.12/4.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 33.12/4.64 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 33.12/4.64 # Preprocessing time : 0.002 s
% 33.12/4.64 # Presaturation interreduction done
% 33.12/4.64
% 33.12/4.64 # Proof found!
% 33.12/4.64 # SZS status Unsatisfiable
% 33.12/4.64 # SZS output start CNFRefutation
% See solution above
% 33.12/4.64 # Parsed axioms : 174
% 33.12/4.64 # Removed by relevancy pruning/SinE : 0
% 33.12/4.64 # Initial clauses : 174
% 33.12/4.64 # Removed in clause preprocessing : 4
% 33.12/4.64 # Initial clauses in saturation : 170
% 33.12/4.64 # Processed clauses : 30477
% 33.12/4.64 # ...of these trivial : 2493
% 33.12/4.64 # ...subsumed : 25320
% 33.12/4.64 # ...remaining for further processing : 2664
% 33.12/4.64 # Other redundant clauses eliminated : 115
% 33.12/4.64 # Clauses deleted for lack of memory : 0
% 33.12/4.64 # Backward-subsumed : 20
% 33.12/4.64 # Backward-rewritten : 55
% 33.12/4.64 # Generated clauses : 341783
% 33.12/4.64 # ...of the previous two non-redundant : 329531
% 33.12/4.64 # ...aggressively subsumed : 0
% 33.12/4.64 # Contextual simplify-reflections : 23
% 33.12/4.64 # Paramodulations : 341629
% 33.12/4.64 # Factorizations : 26
% 33.12/4.64 # NegExts : 0
% 33.12/4.64 # Equation resolutions : 128
% 33.12/4.64 # Disequality decompositions : 0
% 33.12/4.64 # Total rewrite steps : 963758
% 33.12/4.64 # ...of those cached : 963436
% 33.12/4.64 # Propositional unsat checks : 0
% 33.12/4.64 # Propositional check models : 0
% 33.12/4.64 # Propositional check unsatisfiable : 0
% 33.12/4.64 # Propositional clauses : 0
% 33.12/4.64 # Propositional clauses after purity: 0
% 33.12/4.64 # Propositional unsat core size : 0
% 33.12/4.64 # Propositional preprocessing time : 0.000
% 33.12/4.64 # Propositional encoding time : 0.000
% 33.12/4.64 # Propositional solver time : 0.000
% 33.12/4.64 # Success case prop preproc time : 0.000
% 33.12/4.64 # Success case prop encoding time : 0.000
% 33.12/4.64 # Success case prop solver time : 0.000
% 33.12/4.64 # Current number of processed clauses : 2422
% 33.12/4.64 # Positive orientable unit clauses : 174
% 33.12/4.64 # Positive unorientable unit clauses: 0
% 33.12/4.64 # Negative unit clauses : 520
% 33.12/4.64 # Non-unit-clauses : 1728
% 33.12/4.64 # Current number of unprocessed clauses: 299157
% 33.12/4.64 # ...number of literals in the above : 858726
% 33.12/4.64 # Current number of archived formulas : 0
% 33.12/4.64 # Current number of archived clauses : 237
% 33.12/4.64 # Clause-clause subsumption calls (NU) : 532098
% 33.12/4.64 # Rec. Clause-clause subsumption calls : 366942
% 33.12/4.64 # Non-unit clause-clause subsumptions : 760
% 33.12/4.64 # Unit Clause-clause subsumption calls : 70520
% 33.12/4.64 # Rewrite failures with RHS unbound : 0
% 33.12/4.64 # BW rewrite match attempts : 1729
% 33.12/4.64 # BW rewrite match successes : 27
% 33.12/4.64 # Condensation attempts : 0
% 33.12/4.64 # Condensation successes : 0
% 33.12/4.64 # Termbank termtop insertions : 8622187
% 33.12/4.64 # Search garbage collected termcells : 336
% 33.12/4.64
% 33.12/4.64 # -------------------------------------------------
% 33.12/4.64 # User time : 3.878 s
% 33.12/4.64 # System time : 0.242 s
% 33.12/4.64 # Total time : 4.120 s
% 33.12/4.64 # Maximum resident set size: 2040 pages
% 33.12/4.64
% 33.12/4.64 # -------------------------------------------------
% 33.12/4.64 # User time : 20.022 s
% 33.12/4.64 # System time : 0.495 s
% 33.12/4.64 # Total time : 20.518 s
% 33.12/4.64 # Maximum resident set size: 1836 pages
% 33.12/4.64 % E---3.1 exiting
%------------------------------------------------------------------------------