TSTP Solution File: SYN523-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN523-1 : TPTP v8.1.2. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:32:24 EDT 2023
% Result : Satisfiable 0.18s 0.48s
% Output : Saturation 0.18s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_55)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_54,negated_conjecture,
ndr1_0,
inference(spm,[status(thm)],[c_0_51,c_0_52]),
[final] ).
cnf(c_0_66,negated_conjecture,
( ~ c3_1(a148)
| ~ c5_0
| ~ c1_0 ),
clause30,
[final] ).
cnf(c_0_67,negated_conjecture,
( ndr1_1(X1)
| c4_1(X1)
| c3_1(X1)
| ssSkC2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]),
[final] ).
cnf(c_0_71,negated_conjecture,
( ~ c3_1(a151)
| ~ c3_0 ),
clause21,
[final] ).
cnf(c_0_77,negated_conjecture,
( c4_2(X1,X2)
| c1_2(X1,X2)
| ~ c5_1(X1)
| ~ ndr1_1(X1)
| ~ c1_0
| ~ c3_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_54])]),
[final] ).
cnf(c_0_78,negated_conjecture,
( ssSkC0
| ~ c4_2(X1,a142)
| ~ c1_1(X1)
| ~ ssSkP0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_54])]),
[final] ).
cnf(c_0_79,negated_conjecture,
( c2_2(a155,a156)
| c5_1(X1)
| c1_1(X1)
| c4_1(X1)
| ~ c4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_54])]),
[final] ).
cnf(c_0_80,negated_conjecture,
( c5_2(a155,a156)
| c5_1(X1)
| c1_1(X1)
| c4_1(X1)
| ~ c4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_54])]),
[final] ).
cnf(c_0_81,negated_conjecture,
( c1_2(a155,a156)
| c5_1(X1)
| c1_1(X1)
| c4_1(X1)
| ~ c4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_54])]),
[final] ).
cnf(c_0_82,negated_conjecture,
( c5_1(X1)
| c1_1(X1)
| c4_1(X1)
| ~ c4_1(a155)
| ~ c4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_54])]),
[final] ).
cnf(c_0_83,negated_conjecture,
( c3_2(X1,a142)
| ssSkC0
| ~ c1_1(X1)
| ~ ssSkP0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_54])]),
[final] ).
cnf(c_0_84,negated_conjecture,
( c5_2(X1,a149)
| c4_1(X1)
| c3_1(X1)
| ssSkC2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_54])]),
[final] ).
cnf(c_0_85,negated_conjecture,
( c5_2(a155,X1)
| c5_1(X2)
| c1_1(X2)
| c4_1(X2)
| ~ c4_2(a155,X1)
| ~ c2_2(a155,X1)
| ~ ndr1_1(a155)
| ~ c4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_54])]),
[final] ).
cnf(c_0_86,negated_conjecture,
( c4_2(X1,a149)
| c4_1(X1)
| c3_1(X1)
| ssSkC2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_54])]),
[final] ).
cnf(c_0_87,negated_conjecture,
( c5_1(X1)
| c1_1(X1)
| ndr1_1(a155)
| c4_1(X1)
| ~ c4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_54])]),
[final] ).
cnf(c_0_88,negated_conjecture,
( ndr1_1(a148)
| c4_1(a148)
| ssSkC2
| ~ c1_0
| ~ c5_0 ),
inference(spm,[status(thm)],[c_0_66,c_0_67]),
[final] ).
cnf(c_0_89,negated_conjecture,
( ssSkC0
| ndr1_1(X1)
| ~ c1_1(X1)
| ~ ssSkP0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_54])]),
[final] ).
cnf(c_0_90,negated_conjecture,
( c5_1(X1)
| c4_0
| ~ c5_2(X1,a147)
| ~ ssSkC1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_54])]),
[final] ).
cnf(c_0_91,negated_conjecture,
( c5_1(X1)
| c4_0
| ~ c1_2(X1,a147)
| ~ ssSkC1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_54])]),
[final] ).
cnf(c_0_92,negated_conjecture,
( ndr1_1(a151)
| c4_1(a151)
| ssSkC2
| ~ c3_0 ),
inference(spm,[status(thm)],[c_0_71,c_0_67]),
[final] ).
cnf(c_0_93,negated_conjecture,
( c5_1(X1)
| c4_1(X1)
| c2_0
| ~ c4_1(a152) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_54])]),
[final] ).
cnf(c_0_94,negated_conjecture,
( c5_1(X1)
| c4_1(X1)
| c2_0
| ~ c1_1(a152) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_54])]),
[final] ).
cnf(c_0_95,negated_conjecture,
( c3_2(X1,a147)
| c5_1(X1)
| c4_0
| ~ ssSkC1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_54])]),
[final] ).
cnf(c_0_96,negated_conjecture,
( c5_1(X1)
| c4_1(X1)
| c3_1(a152)
| c2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_54])]),
[final] ).
cnf(c_0_97,negated_conjecture,
( c5_1(X1)
| ndr1_1(X1)
| c4_0
| ~ ssSkC1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_54])]),
[final] ).
cnf(c_0_98,negated_conjecture,
( c2_0
| ~ c2_2(a145,X1)
| ~ c5_2(a145,X1)
| ~ c1_2(a145,X1)
| ~ ndr1_1(a145) ),
clause53,
[final] ).
cnf(c_0_99,negated_conjecture,
( c3_0
| ~ ssSkC3
| ~ c5_2(a154,X1)
| ~ c1_2(a154,X1)
| ~ ndr1_1(a154) ),
clause51,
[final] ).
cnf(c_0_100,negated_conjecture,
( c3_2(a144,X1)
| c4_2(a144,X1)
| ~ c5_2(a144,X1)
| ~ ndr1_1(a144)
| ~ c4_0 ),
clause52,
[final] ).
cnf(c_0_101,negated_conjecture,
( c5_2(a150,X1)
| c3_0
| ~ ssSkC2
| ~ c4_2(a150,X1)
| ~ ndr1_1(a150) ),
clause45,
[final] ).
cnf(c_0_102,negated_conjecture,
( ssSkP0(X1)
| ~ c1_2(X1,a141) ),
clause27,
[final] ).
cnf(c_0_103,negated_conjecture,
( ssSkP0(X1)
| ~ c5_2(X1,a141) ),
clause26,
[final] ).
cnf(c_0_104,negated_conjecture,
( ssSkP0(X1)
| ~ c2_2(X1,a141) ),
clause25,
[final] ).
cnf(c_0_105,negated_conjecture,
( c3_0
| ~ ssSkC2
| ~ c4_1(a150) ),
clause22,
[final] ).
cnf(c_0_106,negated_conjecture,
( ndr1_1(X1)
| ssSkP0(X1) ),
clause11,
[final] ).
cnf(c_0_107,negated_conjecture,
( c3_0
| ~ ssSkC3
| ~ c5_1(a154) ),
clause19,
[final] ).
cnf(c_0_108,negated_conjecture,
( c5_1(a148)
| ~ c5_0
| ~ c1_0 ),
clause28,
[final] ).
cnf(c_0_109,negated_conjecture,
( c1_1(a154)
| c3_0
| ~ ssSkC3 ),
clause12,
[final] ).
cnf(c_0_110,negated_conjecture,
( ssSkC1
| ~ c3_1(a146) ),
clause18,
[final] ).
cnf(c_0_111,negated_conjecture,
( ssSkC3
| ~ c5_1(a153) ),
clause17,
[final] ).
cnf(c_0_112,negated_conjecture,
( ssSkC3
| ~ c1_1(a153) ),
clause16,
[final] ).
cnf(c_0_113,negated_conjecture,
( c2_0
| ~ c5_1(a145) ),
clause13,
[final] ).
cnf(c_0_114,negated_conjecture,
( c5_1(a144)
| ~ c4_0 ),
clause14,
[final] ).
cnf(c_0_115,negated_conjecture,
( c4_1(a146)
| ssSkC1 ),
clause10,
[final] ).
cnf(c_0_116,negated_conjecture,
( c3_1(a145)
| c2_0 ),
clause7,
[final] ).
cnf(c_0_117,negated_conjecture,
( c5_0
| c2_0
| c1_0 ),
clause9,
[final] ).
cnf(c_0_118,negated_conjecture,
( ~ c2_1(a148)
| ~ c5_0
| ~ c1_0 ),
clause31,
[final] ).
cnf(c_0_119,negated_conjecture,
( ~ ssSkC0
| ~ c1_1(a143)
| ~ c2_0 ),
clause29,
[final] ).
cnf(c_0_120,negated_conjecture,
( ~ c4_1(a144)
| ~ c4_0 ),
clause24,
[final] ).
cnf(c_0_121,negated_conjecture,
( ~ c2_1(a151)
| ~ c3_0 ),
clause20,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN523-1 : TPTP v8.1.2. Released v2.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 18:21:14 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.18/0.47 Running first-order model finding
% 0.18/0.47 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.L3bo70RHgZ/E---3.1_22321.p
% 0.18/0.48 # Version: 3.1pre001
% 0.18/0.48 # Preprocessing class: FSLSSLSMSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # Starting sh5l with 300s (1) cores
% 0.18/0.48 # new_bool_3 with pid 22399 completed with status 1
% 0.18/0.48 # Result found by new_bool_3
% 0.18/0.48 # Preprocessing class: FSLSSLSMSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.48 # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.18/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting H----_011_C07_F1_PI_AE_OS_S1U with 163s (1) cores
% 0.18/0.48 # H----_011_C07_F1_PI_AE_OS_S1U with pid 22407 completed with status 1
% 0.18/0.48 # Result found by H----_011_C07_F1_PI_AE_OS_S1U
% 0.18/0.48 # Preprocessing class: FSLSSLSMSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.48 # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.18/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting H----_011_C07_F1_PI_AE_OS_S1U with 163s (1) cores
% 0.18/0.48 # Preprocessing time : 0.002 s
% 0.18/0.48
% 0.18/0.48 # No proof found!
% 0.18/0.48 # SZS status Satisfiable
% 0.18/0.48 # SZS output start Saturation
% See solution above
% 0.18/0.48 # Parsed axioms : 55
% 0.18/0.48 # Removed by relevancy pruning/SinE : 0
% 0.18/0.48 # Initial clauses : 55
% 0.18/0.48 # Removed in clause preprocessing : 0
% 0.18/0.48 # Initial clauses in saturation : 55
% 0.18/0.48 # Processed clauses : 80
% 0.18/0.48 # ...of these trivial : 0
% 0.18/0.48 # ...subsumed : 1
% 0.18/0.48 # ...remaining for further processing : 79
% 0.18/0.48 # Other redundant clauses eliminated : 0
% 0.18/0.48 # Clauses deleted for lack of memory : 0
% 0.18/0.48 # Backward-subsumed : 2
% 0.18/0.48 # Backward-rewritten : 28
% 0.18/0.48 # Generated clauses : 12
% 0.18/0.48 # ...of the previous two non-redundant : 27
% 0.18/0.48 # ...aggressively subsumed : 0
% 0.18/0.48 # Contextual simplify-reflections : 0
% 0.18/0.48 # Paramodulations : 12
% 0.18/0.48 # Factorizations : 0
% 0.18/0.48 # NegExts : 0
% 0.18/0.48 # Equation resolutions : 0
% 0.18/0.48 # Total rewrite steps : 28
% 0.18/0.48 # Propositional unsat checks : 0
% 0.18/0.48 # Propositional check models : 0
% 0.18/0.48 # Propositional check unsatisfiable : 0
% 0.18/0.48 # Propositional clauses : 0
% 0.18/0.48 # Propositional clauses after purity: 0
% 0.18/0.48 # Propositional unsat core size : 0
% 0.18/0.48 # Propositional preprocessing time : 0.000
% 0.18/0.48 # Propositional encoding time : 0.000
% 0.18/0.48 # Propositional solver time : 0.000
% 0.18/0.48 # Success case prop preproc time : 0.000
% 0.18/0.48 # Success case prop encoding time : 0.000
% 0.18/0.48 # Success case prop solver time : 0.000
% 0.18/0.48 # Current number of processed clauses : 49
% 0.18/0.48 # Positive orientable unit clauses : 1
% 0.18/0.48 # Positive unorientable unit clauses: 0
% 0.18/0.48 # Negative unit clauses : 0
% 0.18/0.48 # Non-unit-clauses : 48
% 0.18/0.48 # Current number of unprocessed clauses: 0
% 0.18/0.48 # ...number of literals in the above : 0
% 0.18/0.48 # Current number of archived formulas : 0
% 0.18/0.48 # Current number of archived clauses : 30
% 0.18/0.48 # Clause-clause subsumption calls (NU) : 450
% 0.18/0.48 # Rec. Clause-clause subsumption calls : 59
% 0.18/0.48 # Non-unit clause-clause subsumptions : 3
% 0.18/0.48 # Unit Clause-clause subsumption calls : 3
% 0.18/0.48 # Rewrite failures with RHS unbound : 0
% 0.18/0.48 # BW rewrite match attempts : 1
% 0.18/0.48 # BW rewrite match successes : 1
% 0.18/0.48 # Condensation attempts : 0
% 0.18/0.48 # Condensation successes : 0
% 0.18/0.48 # Termbank termtop insertions : 1988
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.004 s
% 0.18/0.48 # System time : 0.004 s
% 0.18/0.48 # Total time : 0.008 s
% 0.18/0.48 # Maximum resident set size: 1804 pages
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.005 s
% 0.18/0.48 # System time : 0.007 s
% 0.18/0.48 # Total time : 0.012 s
% 0.18/0.48 # Maximum resident set size: 1724 pages
% 0.18/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------