TSTP Solution File: CSR040+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR040+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : 600s
% DateTime : Fri Jul 15 02:46:52 EDT 2022
% Result : Theorem 12.53s 3.90s
% Output : CNFRefutation 12.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 21
% Syntax : Number of clauses : 61 ( 17 unt; 0 nHn; 61 RR)
% Number of literals : 105 ( 0 equ; 46 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 21 ( 20 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_984,plain,
( tptpcol_14_109181(X1)
| ~ tptpcol_15_109185(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_984) ).
cnf(i_0_2661,negated_conjecture,
tptpcol_15_109185(c_tptpcol_16_62187),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_2661) ).
cnf(i_0_384,plain,
( tptpcol_8_109059(X1)
| ~ tptpcol_9_109060(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_384) ).
cnf(i_0_868,plain,
( tptpcol_9_109060(X1)
| ~ tptpcol_10_109061(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_868) ).
cnf(i_0_144,plain,
( tptpcol_13_109173(X1)
| ~ tptpcol_14_109181(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_144) ).
cnf(i_0_746,plain,
( tptpcol_7_108547(X1)
| ~ tptpcol_8_109059(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_746) ).
cnf(i_0_76,plain,
( tptpcol_12_109157(X1)
| ~ tptpcol_13_109173(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_76) ).
cnf(i_0_41,plain,
( tptpcol_10_109061(X1)
| ~ tptpcol_11_109125(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_41) ).
cnf(i_0_516,plain,
( tptpcol_11_109125(X1)
| ~ tptpcol_12_109157(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_516) ).
cnf(i_0_93,plain,
( tptpcol_6_108546(X1)
| ~ tptpcol_7_108547(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_93) ).
cnf(i_0_794,plain,
( tptpcol_5_106498(X1)
| ~ tptpcol_6_108546(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_794) ).
cnf(i_0_37,plain,
( tptpcol_4_106497(X1)
| ~ tptpcol_5_106498(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_37) ).
cnf(i_0_110,plain,
( tptpcol_1_65536(X1)
| ~ tptpcol_2_98304(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_110) ).
cnf(i_0_170,plain,
( tptpcol_2_98304(X1)
| ~ tptpcol_3_98305(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_170) ).
cnf(i_0_574,plain,
( tptpcol_3_98305(X1)
| ~ tptpcol_4_106497(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_574) ).
cnf(i_0_296,plain,
( individual(X1)
| ~ tptpcol_0_0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_296) ).
cnf(i_0_417,plain,
( tptpcol_0_0(X1)
| ~ tptpcol_1_65536(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_417) ).
cnf(i_0_1322,plain,
( collection(X1)
| ~ fixedordercollection(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_1322) ).
cnf(i_0_865,plain,
( fixedordercollection(X1)
| ~ firstordercollection(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_865) ).
cnf(i_0_803,plain,
firstordercollection(c_tptpcol_16_62187),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_803) ).
cnf(i_0_808,plain,
( ~ individual(X1)
| ~ collection(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hklpk04x/input.p',i_0_808) ).
cnf(c_0_2683,plain,
( tptpcol_14_109181(X1)
| ~ tptpcol_15_109185(X1) ),
i_0_984 ).
cnf(c_0_2684,negated_conjecture,
tptpcol_15_109185(c_tptpcol_16_62187),
i_0_2661 ).
cnf(c_0_2685,plain,
( tptpcol_8_109059(X1)
| ~ tptpcol_9_109060(X1) ),
i_0_384 ).
cnf(c_0_2686,plain,
( tptpcol_9_109060(X1)
| ~ tptpcol_10_109061(X1) ),
i_0_868 ).
cnf(c_0_2687,plain,
( tptpcol_13_109173(X1)
| ~ tptpcol_14_109181(X1) ),
i_0_144 ).
cnf(c_0_2688,negated_conjecture,
tptpcol_14_109181(c_tptpcol_16_62187),
inference(spm,[status(thm)],[c_0_2683,c_0_2684]) ).
cnf(c_0_2689,plain,
( tptpcol_7_108547(X1)
| ~ tptpcol_8_109059(X1) ),
i_0_746 ).
cnf(c_0_2690,plain,
( tptpcol_8_109059(X1)
| ~ tptpcol_10_109061(X1) ),
inference(spm,[status(thm)],[c_0_2685,c_0_2686]) ).
cnf(c_0_2691,plain,
( tptpcol_12_109157(X1)
| ~ tptpcol_13_109173(X1) ),
i_0_76 ).
cnf(c_0_2692,plain,
tptpcol_13_109173(c_tptpcol_16_62187),
inference(spm,[status(thm)],[c_0_2687,c_0_2688]) ).
cnf(c_0_2693,plain,
( tptpcol_7_108547(X1)
| ~ tptpcol_10_109061(X1) ),
inference(spm,[status(thm)],[c_0_2689,c_0_2690]) ).
cnf(c_0_2694,plain,
( tptpcol_10_109061(X1)
| ~ tptpcol_11_109125(X1) ),
i_0_41 ).
cnf(c_0_2695,plain,
( tptpcol_11_109125(X1)
| ~ tptpcol_12_109157(X1) ),
i_0_516 ).
cnf(c_0_2696,plain,
tptpcol_12_109157(c_tptpcol_16_62187),
inference(spm,[status(thm)],[c_0_2691,c_0_2692]) ).
cnf(c_0_2697,plain,
( tptpcol_7_108547(X1)
| ~ tptpcol_11_109125(X1) ),
inference(spm,[status(thm)],[c_0_2693,c_0_2694]) ).
cnf(c_0_2698,plain,
tptpcol_11_109125(c_tptpcol_16_62187),
inference(spm,[status(thm)],[c_0_2695,c_0_2696]) ).
cnf(c_0_2699,plain,
( tptpcol_6_108546(X1)
| ~ tptpcol_7_108547(X1) ),
i_0_93 ).
cnf(c_0_2700,plain,
tptpcol_7_108547(c_tptpcol_16_62187),
inference(spm,[status(thm)],[c_0_2697,c_0_2698]) ).
cnf(c_0_2701,plain,
( tptpcol_5_106498(X1)
| ~ tptpcol_6_108546(X1) ),
i_0_794 ).
cnf(c_0_2702,plain,
tptpcol_6_108546(c_tptpcol_16_62187),
inference(spm,[status(thm)],[c_0_2699,c_0_2700]) ).
cnf(c_0_2703,plain,
( tptpcol_4_106497(X1)
| ~ tptpcol_5_106498(X1) ),
i_0_37 ).
cnf(c_0_2704,plain,
tptpcol_5_106498(c_tptpcol_16_62187),
inference(spm,[status(thm)],[c_0_2701,c_0_2702]) ).
cnf(c_0_2705,plain,
( tptpcol_1_65536(X1)
| ~ tptpcol_2_98304(X1) ),
i_0_110 ).
cnf(c_0_2706,plain,
( tptpcol_2_98304(X1)
| ~ tptpcol_3_98305(X1) ),
i_0_170 ).
cnf(c_0_2707,plain,
( tptpcol_3_98305(X1)
| ~ tptpcol_4_106497(X1) ),
i_0_574 ).
cnf(c_0_2708,plain,
tptpcol_4_106497(c_tptpcol_16_62187),
inference(spm,[status(thm)],[c_0_2703,c_0_2704]) ).
cnf(c_0_2709,plain,
( individual(X1)
| ~ tptpcol_0_0(X1) ),
i_0_296 ).
cnf(c_0_2710,plain,
( tptpcol_0_0(X1)
| ~ tptpcol_1_65536(X1) ),
i_0_417 ).
cnf(c_0_2711,plain,
( tptpcol_1_65536(X1)
| ~ tptpcol_3_98305(X1) ),
inference(spm,[status(thm)],[c_0_2705,c_0_2706]) ).
cnf(c_0_2712,plain,
tptpcol_3_98305(c_tptpcol_16_62187),
inference(spm,[status(thm)],[c_0_2707,c_0_2708]) ).
cnf(c_0_2713,plain,
( collection(X1)
| ~ fixedordercollection(X1) ),
i_0_1322 ).
cnf(c_0_2714,plain,
( fixedordercollection(X1)
| ~ firstordercollection(X1) ),
i_0_865 ).
cnf(c_0_2715,plain,
( individual(X1)
| ~ tptpcol_1_65536(X1) ),
inference(spm,[status(thm)],[c_0_2709,c_0_2710]) ).
cnf(c_0_2716,plain,
tptpcol_1_65536(c_tptpcol_16_62187),
inference(spm,[status(thm)],[c_0_2711,c_0_2712]) ).
cnf(c_0_2717,plain,
( collection(X1)
| ~ firstordercollection(X1) ),
inference(spm,[status(thm)],[c_0_2713,c_0_2714]) ).
cnf(c_0_2718,plain,
firstordercollection(c_tptpcol_16_62187),
i_0_803 ).
cnf(c_0_2719,plain,
( ~ individual(X1)
| ~ collection(X1) ),
i_0_808 ).
cnf(c_0_2720,plain,
individual(c_tptpcol_16_62187),
inference(spm,[status(thm)],[c_0_2715,c_0_2716]) ).
cnf(c_0_2721,plain,
collection(c_tptpcol_16_62187),
inference(spm,[status(thm)],[c_0_2717,c_0_2718]) ).
cnf(c_0_2722,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2719,c_0_2720]),c_0_2721])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CSR040+3 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 11 03:16:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.42/0.60 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.42/0.60 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.42/0.60 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.42/0.60 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 12.53/3.90 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 12.53/3.90 # Version: 2.1pre011
% 12.53/3.90 # Preprocessing time : 0.081 s
% 12.53/3.90
% 12.53/3.90 # Proof found!
% 12.53/3.90 # SZS status Theorem
% 12.53/3.90 # SZS output start CNFRefutation
% See solution above
% 12.53/3.90 # Proof object total steps : 61
% 12.53/3.90 # Proof object clause steps : 40
% 12.53/3.90 # Proof object formula steps : 21
% 12.53/3.90 # Proof object conjectures : 3
% 12.53/3.90 # Proof object clause conjectures : 2
% 12.53/3.90 # Proof object formula conjectures : 1
% 12.53/3.90 # Proof object initial clauses used : 21
% 12.53/3.90 # Proof object initial formulas used : 21
% 12.53/3.90 # Proof object generating inferences : 19
% 12.53/3.90 # Proof object simplifying inferences : 2
% 12.53/3.90 # Training examples: 0 positive, 0 negative
% 12.53/3.90 # Parsed axioms : 2662
% 12.53/3.90 # Removed by relevancy pruning/SinE : 0
% 12.53/3.90 # Initial clauses : 2662
% 12.53/3.90 # Removed in clause preprocessing : 0
% 12.53/3.90 # Initial clauses in saturation : 2662
% 12.53/3.90 # Processed clauses : 5229
% 12.53/3.90 # ...of these trivial : 848
% 12.53/3.90 # ...subsumed : 259
% 12.53/3.90 # ...remaining for further processing : 4122
% 12.53/3.90 # Other redundant clauses eliminated : 0
% 12.53/3.90 # Clauses deleted for lack of memory : 0
% 12.53/3.90 # Backward-subsumed : 5
% 12.53/3.90 # Backward-rewritten : 252
% 12.53/3.90 # Generated clauses : 5789
% 12.53/3.90 # ...of the previous two non-trivial : 5470
% 12.53/3.90 # Contextual simplify-reflections : 13
% 12.53/3.90 # Paramodulations : 5789
% 12.53/3.90 # Factorizations : 0
% 12.53/3.90 # Equation resolutions : 0
% 12.53/3.90 # Propositional unsat checks : 0
% 12.53/3.90 # Propositional unsat check successes : 0
% 12.53/3.90 # Current number of processed clauses : 3865
% 12.53/3.90 # Positive orientable unit clauses : 1461
% 12.53/3.90 # Positive unorientable unit clauses: 0
% 12.53/3.90 # Negative unit clauses : 828
% 12.53/3.90 # Non-unit-clauses : 1576
% 12.53/3.90 # Current number of unprocessed clauses: 2768
% 12.53/3.90 # ...number of literals in the above : 4414
% 12.53/3.90 # Current number of archived formulas : 0
% 12.53/3.90 # Current number of archived clauses : 257
% 12.53/3.90 # Clause-clause subsumption calls (NU) : 475671
% 12.53/3.90 # Rec. Clause-clause subsumption calls : 403899
% 12.53/3.90 # Non-unit clause-clause subsumptions : 238
% 12.53/3.90 # Unit Clause-clause subsumption calls : 693559
% 12.53/3.90 # Rewrite failures with RHS unbound : 0
% 12.53/3.90 # BW rewrite match attempts : 104
% 12.53/3.90 # BW rewrite match successes : 40
% 12.53/3.90 # Condensation attempts : 0
% 12.53/3.90 # Condensation successes : 0
% 12.53/3.90 # Termbank termtop insertions : 82968
% 12.53/3.90
% 12.53/3.90 # -------------------------------------------------
% 12.53/3.90 # User time : 0.553 s
% 12.53/3.90 # System time : 0.014 s
% 12.53/3.90 # Total time : 0.567 s
% 12.53/3.90 # ...preprocessing : 0.081 s
% 12.53/3.90 # ...main loop : 0.486 s
% 12.53/3.90 # Maximum resident set size: 23680 pages
% 12.53/3.90
%------------------------------------------------------------------------------