TSTP Solution File: SYN554-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN554-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:17:47 EDT 2023
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 13 unt; 2 nHn; 22 RR)
% Number of literals : 48 ( 0 equ; 25 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p2_6,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X2)
| ~ p2(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.gLAJqVPWuw/E---3.1_14876.p',p2_6) ).
cnf(p2_1,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.gLAJqVPWuw/E---3.1_14876.p',p2_1) ).
cnf(p4_8,negated_conjecture,
( p4(X1,X2)
| ~ p2(X3,X2)
| ~ p4(X4,X3)
| ~ p2(X4,X1) ),
file('/export/starexec/sandbox/tmp/tmp.gLAJqVPWuw/E---3.1_14876.p',p4_8) ).
cnf(p2_4,negated_conjecture,
p2(f3(c5,c6),f3(c5,c7)),
file('/export/starexec/sandbox/tmp/tmp.gLAJqVPWuw/E---3.1_14876.p',p2_4) ).
cnf(not_p4_2,negated_conjecture,
~ p4(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.gLAJqVPWuw/E---3.1_14876.p',not_p4_2) ).
cnf(p4_7,negated_conjecture,
( p4(f3(c5,X1),f3(c5,X2))
| ~ p4(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.gLAJqVPWuw/E---3.1_14876.p',p4_7) ).
cnf(p2_5,negated_conjecture,
( p2(X1,X2)
| p4(X1,X2)
| p4(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.gLAJqVPWuw/E---3.1_14876.p',p2_5) ).
cnf(not_p2_3,negated_conjecture,
~ p2(c6,c7),
file('/export/starexec/sandbox/tmp/tmp.gLAJqVPWuw/E---3.1_14876.p',not_p2_3) ).
cnf(c_0_8,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X2)
| ~ p2(X3,X1) ),
p2_6 ).
cnf(c_0_9,negated_conjecture,
p2(X1,X1),
p2_1 ).
cnf(c_0_10,negated_conjecture,
( p4(X1,X2)
| ~ p2(X3,X2)
| ~ p4(X4,X3)
| ~ p2(X4,X1) ),
p4_8 ).
cnf(c_0_11,negated_conjecture,
( p2(X1,X2)
| ~ p2(X2,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
p2(f3(c5,c6),f3(c5,c7)),
p2_4 ).
cnf(c_0_13,negated_conjecture,
( p4(X1,X2)
| ~ p4(X1,X3)
| ~ p2(X3,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
p2(f3(c5,c7),f3(c5,c6)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ p4(X1,X1),
not_p4_2 ).
cnf(c_0_16,negated_conjecture,
( p4(X1,f3(c5,c7))
| ~ p4(X1,f3(c5,c6)) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( p4(X1,f3(c5,c6))
| ~ p4(X1,f3(c5,c7)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( p4(f3(c5,X1),f3(c5,X2))
| ~ p4(X1,X2) ),
p4_7 ).
cnf(c_0_19,negated_conjecture,
~ p4(f3(c5,c7),f3(c5,c6)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( p4(f3(c5,X1),f3(c5,c6))
| ~ p4(X1,c7) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
~ p4(c7,c6),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( p2(X1,X2)
| p4(X1,X2)
| p4(X2,X1) ),
p2_5 ).
cnf(c_0_23,negated_conjecture,
~ p2(c6,c7),
not_p2_3 ).
cnf(c_0_24,negated_conjecture,
~ p4(c6,c7),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN554-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 18:32:54 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.gLAJqVPWuw/E---3.1_14876.p
% 0.21/0.50 # Version: 3.1pre001
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # new_bool_3 with pid 14961 completed with status 0
% 0.21/0.50 # Result found by new_bool_3
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # SAT001_MinMin_p005000_rr_RG with pid 14966 completed with status 0
% 0.21/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 9
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 9
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 9
% 0.21/0.50 # Processed clauses : 33
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 2
% 0.21/0.50 # ...remaining for further processing : 30
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 42
% 0.21/0.50 # ...of the previous two non-redundant : 30
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 40
% 0.21/0.50 # Factorizations : 2
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Total rewrite steps : 10
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 21
% 0.21/0.50 # Positive orientable unit clauses : 3
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 5
% 0.21/0.50 # Non-unit-clauses : 13
% 0.21/0.50 # Current number of unprocessed clauses: 15
% 0.21/0.50 # ...number of literals in the above : 50
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 9
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 16
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 16
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 3
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 3
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 694
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.002 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.005 s
% 0.21/0.50 # Maximum resident set size: 1644 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.002 s
% 0.21/0.50 # System time : 0.006 s
% 0.21/0.50 # Total time : 0.008 s
% 0.21/0.50 # Maximum resident set size: 1676 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------