TSTP Solution File: SYN590-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN590-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 10:09:48 EDT 2024
% Result : Unsatisfiable 0.34s 0.53s
% Output : CNFRefutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 6 unt; 0 nHn; 28 RR)
% Number of literals : 60 ( 0 equ; 37 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p10_26,negated_conjecture,
( p10(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X4,X2)
| ~ p10(X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.DnCGz5qTKu/E---3.1_5633.p',p10_26) ).
cnf(p3_8,negated_conjecture,
p3(f4(c16),f6(c15)),
file('/export/starexec/sandbox2/tmp/tmp.DnCGz5qTKu/E---3.1_5633.p',p3_8) ).
cnf(p10_19,negated_conjecture,
( p10(f4(f9(X1)),f4(X1))
| ~ p11(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.DnCGz5qTKu/E---3.1_5633.p',p10_19) ).
cnf(c16_is_p11_3,negated_conjecture,
p11(c16),
file('/export/starexec/sandbox2/tmp/tmp.DnCGz5qTKu/E---3.1_5633.p',c16_is_p11_3) ).
cnf(p3_18,negated_conjecture,
( p3(f4(X1),f6(f8(X1)))
| ~ p11(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.DnCGz5qTKu/E---3.1_5633.p',p3_18) ).
cnf(not_p11_25,negated_conjecture,
( ~ p11(X1)
| ~ p12(X2,c15)
| ~ p3(f4(X1),f6(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.DnCGz5qTKu/E---3.1_5633.p',not_p11_25) ).
cnf(p12_11,negated_conjecture,
( p12(X1,X2)
| ~ p10(f6(X1),f6(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.DnCGz5qTKu/E---3.1_5633.p',p12_11) ).
cnf(p11_9,negated_conjecture,
( p11(f9(X1))
| ~ p11(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.DnCGz5qTKu/E---3.1_5633.p',p11_9) ).
cnf(c_0_8,negated_conjecture,
( p10(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X4,X2)
| ~ p10(X3,X4) ),
inference(fof_simplification,[status(thm)],[p10_26]) ).
cnf(c_0_9,negated_conjecture,
( p10(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X4,X2)
| ~ p10(X3,X4) ),
c_0_8 ).
cnf(c_0_10,negated_conjecture,
p3(f4(c16),f6(c15)),
p3_8 ).
cnf(c_0_11,negated_conjecture,
( p10(f4(f9(X1)),f4(X1))
| ~ p11(X1) ),
inference(fof_simplification,[status(thm)],[p10_19]) ).
cnf(c_0_12,negated_conjecture,
( p10(X1,f6(c15))
| ~ p10(X2,f4(c16))
| ~ p3(X2,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( p10(f4(f9(X1)),f4(X1))
| ~ p11(X1) ),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
p11(c16),
c16_is_p11_3 ).
cnf(c_0_15,negated_conjecture,
( p3(f4(X1),f6(f8(X1)))
| ~ p11(X1) ),
inference(fof_simplification,[status(thm)],[p3_18]) ).
cnf(c_0_16,negated_conjecture,
( ~ p11(X1)
| ~ p12(X2,c15)
| ~ p3(f4(X1),f6(X2)) ),
inference(fof_simplification,[status(thm)],[not_p11_25]) ).
cnf(c_0_17,negated_conjecture,
( p12(X1,X2)
| ~ p10(f6(X1),f6(X2)) ),
inference(fof_simplification,[status(thm)],[p12_11]) ).
cnf(c_0_18,negated_conjecture,
( p10(X1,f6(c15))
| ~ p3(f4(f9(c16)),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_19,negated_conjecture,
( p3(f4(X1),f6(f8(X1)))
| ~ p11(X1) ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
( ~ p11(X1)
| ~ p12(X2,c15)
| ~ p3(f4(X1),f6(X2)) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
( p12(X1,X2)
| ~ p10(f6(X1),f6(X2)) ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
( p10(f6(f8(f9(c16))),f6(c15))
| ~ p11(f9(c16)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( ~ p12(f8(X1),c15)
| ~ p11(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( p11(f9(X1))
| ~ p11(X1) ),
inference(fof_simplification,[status(thm)],[p11_9]) ).
cnf(c_0_25,negated_conjecture,
~ p11(f9(c16)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( p11(f9(X1))
| ~ p11(X1) ),
c_0_24 ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN590-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n026.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 10:55:51 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.DnCGz5qTKu/E---3.1_5633.p
% 0.34/0.53 # Version: 3.1.0
% 0.34/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.34/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.34/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.34/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.34/0.53 # Starting sh5l with 300s (1) cores
% 0.34/0.53 # sh5l with pid 5715 completed with status 0
% 0.34/0.53 # Result found by sh5l
% 0.34/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.34/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.34/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.34/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.34/0.53 # Starting sh5l with 300s (1) cores
% 0.34/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.34/0.53 # Search class: FHHNS-FFSS11-SFFFFFNN
% 0.34/0.53 # partial match(1): FHHNF-FFSS11-SFFFFFNN
% 0.34/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.34/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 150s (1) cores
% 0.34/0.53 # SAT001_MinMin_p005000_rr_RG with pid 5723 completed with status 0
% 0.34/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.34/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.34/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.34/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.34/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.34/0.53 # Starting sh5l with 300s (1) cores
% 0.34/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.34/0.53 # Search class: FHHNS-FFSS11-SFFFFFNN
% 0.34/0.53 # partial match(1): FHHNF-FFSS11-SFFFFFNN
% 0.34/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.34/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 150s (1) cores
% 0.34/0.53 # Preprocessing time : 0.001 s
% 0.34/0.53 # Presaturation interreduction done
% 0.34/0.53
% 0.34/0.53 # Proof found!
% 0.34/0.53 # SZS status Unsatisfiable
% 0.34/0.53 # SZS output start CNFRefutation
% See solution above
% 0.34/0.53 # Parsed axioms : 27
% 0.34/0.53 # Removed by relevancy pruning/SinE : 0
% 0.34/0.53 # Initial clauses : 27
% 0.34/0.53 # Removed in clause preprocessing : 0
% 0.34/0.53 # Initial clauses in saturation : 27
% 0.34/0.53 # Processed clauses : 304
% 0.34/0.53 # ...of these trivial : 0
% 0.34/0.53 # ...subsumed : 80
% 0.34/0.53 # ...remaining for further processing : 224
% 0.34/0.53 # Other redundant clauses eliminated : 0
% 0.34/0.53 # Clauses deleted for lack of memory : 0
% 0.34/0.53 # Backward-subsumed : 1
% 0.34/0.53 # Backward-rewritten : 0
% 0.34/0.53 # Generated clauses : 532
% 0.34/0.53 # ...of the previous two non-redundant : 487
% 0.34/0.53 # ...aggressively subsumed : 0
% 0.34/0.53 # Contextual simplify-reflections : 1
% 0.34/0.53 # Paramodulations : 532
% 0.34/0.53 # Factorizations : 0
% 0.34/0.53 # NegExts : 0
% 0.34/0.53 # Equation resolutions : 0
% 0.34/0.53 # Disequality decompositions : 0
% 0.34/0.53 # Total rewrite steps : 58
% 0.34/0.53 # ...of those cached : 41
% 0.34/0.53 # Propositional unsat checks : 0
% 0.34/0.53 # Propositional check models : 0
% 0.34/0.53 # Propositional check unsatisfiable : 0
% 0.34/0.53 # Propositional clauses : 0
% 0.34/0.53 # Propositional clauses after purity: 0
% 0.34/0.53 # Propositional unsat core size : 0
% 0.34/0.53 # Propositional preprocessing time : 0.000
% 0.34/0.53 # Propositional encoding time : 0.000
% 0.34/0.53 # Propositional solver time : 0.000
% 0.34/0.53 # Success case prop preproc time : 0.000
% 0.34/0.53 # Success case prop encoding time : 0.000
% 0.34/0.53 # Success case prop solver time : 0.000
% 0.34/0.53 # Current number of processed clauses : 197
% 0.34/0.53 # Positive orientable unit clauses : 20
% 0.34/0.53 # Positive unorientable unit clauses: 0
% 0.34/0.53 # Negative unit clauses : 9
% 0.34/0.53 # Non-unit-clauses : 168
% 0.34/0.53 # Current number of unprocessed clauses: 236
% 0.34/0.53 # ...number of literals in the above : 696
% 0.34/0.53 # Current number of archived formulas : 0
% 0.34/0.53 # Current number of archived clauses : 27
% 0.34/0.53 # Clause-clause subsumption calls (NU) : 2098
% 0.34/0.53 # Rec. Clause-clause subsumption calls : 1920
% 0.34/0.53 # Non-unit clause-clause subsumptions : 68
% 0.34/0.53 # Unit Clause-clause subsumption calls : 194
% 0.34/0.53 # Rewrite failures with RHS unbound : 0
% 0.34/0.53 # BW rewrite match attempts : 2
% 0.34/0.53 # BW rewrite match successes : 0
% 0.34/0.53 # Condensation attempts : 0
% 0.34/0.53 # Condensation successes : 0
% 0.34/0.53 # Termbank termtop insertions : 7233
% 0.34/0.53 # Search garbage collected termcells : 60
% 0.34/0.53
% 0.34/0.53 # -------------------------------------------------
% 0.34/0.53 # User time : 0.019 s
% 0.34/0.53 # System time : 0.002 s
% 0.34/0.53 # Total time : 0.021 s
% 0.34/0.53 # Maximum resident set size: 1764 pages
% 0.34/0.53
% 0.34/0.53 # -------------------------------------------------
% 0.34/0.53 # User time : 0.021 s
% 0.34/0.53 # System time : 0.004 s
% 0.34/0.53 # Total time : 0.025 s
% 0.34/0.53 # Maximum resident set size: 1708 pages
% 0.34/0.53 % E---3.1 exiting
% 0.34/0.53 % E exiting
%------------------------------------------------------------------------------