TSTP Solution File: SYN084+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN084+1 : TPTP v8.1.2. Released v2.0.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:13:44 EDT 2023
% Result : Theorem 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 1
% Syntax : Number of formulae : 33 ( 6 unt; 0 def)
% Number of atoms : 221 ( 0 equ)
% Maximal formula atoms : 114 ( 6 avg)
% Number of connectives : 291 ( 103 ~; 148 |; 34 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 5 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 23 ( 0 sgn; 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel62,conjecture,
( ! [X1] :
( ( big_p(a)
& ( big_p(X1)
=> big_p(f(X1)) ) )
=> big_p(f(f(X1))) )
<=> ! [X2] :
( ( ~ big_p(a)
| big_p(X2)
| big_p(f(f(X2))) )
& ( ~ big_p(a)
| ~ big_p(f(X2))
| big_p(f(f(X2))) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XPRued0p6U/E---3.1_17940.p',pel62) ).
fof(c_0_1,negated_conjecture,
~ ( ! [X1] :
( ( big_p(a)
& ( big_p(X1)
=> big_p(f(X1)) ) )
=> big_p(f(f(X1))) )
<=> ! [X2] :
( ( ~ big_p(a)
| big_p(X2)
| big_p(f(f(X2))) )
& ( ~ big_p(a)
| ~ big_p(f(X2))
| big_p(f(f(X2))) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[pel62])]) ).
fof(c_0_2,negated_conjecture,
! [X5,X6] :
( ( big_p(a)
| big_p(a)
| big_p(a) )
& ( big_p(f(esk2_0))
| big_p(a)
| big_p(a) )
& ( ~ big_p(f(f(esk2_0)))
| big_p(a)
| big_p(a) )
& ( big_p(a)
| ~ big_p(esk2_0)
| big_p(a) )
& ( big_p(f(esk2_0))
| ~ big_p(esk2_0)
| big_p(a) )
& ( ~ big_p(f(f(esk2_0)))
| ~ big_p(esk2_0)
| big_p(a) )
& ( big_p(a)
| ~ big_p(f(f(esk2_0)))
| big_p(a) )
& ( big_p(f(esk2_0))
| ~ big_p(f(f(esk2_0)))
| big_p(a) )
& ( ~ big_p(f(f(esk2_0)))
| ~ big_p(f(f(esk2_0)))
| big_p(a) )
& ( big_p(a)
| big_p(a)
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( big_p(f(esk2_0))
| big_p(a)
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( ~ big_p(f(f(esk2_0)))
| big_p(a)
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( big_p(a)
| ~ big_p(esk2_0)
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( big_p(f(esk2_0))
| ~ big_p(esk2_0)
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( ~ big_p(f(f(esk2_0)))
| ~ big_p(esk2_0)
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( big_p(a)
| ~ big_p(f(f(esk2_0)))
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( big_p(f(esk2_0))
| ~ big_p(f(f(esk2_0)))
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( ~ big_p(f(f(esk2_0)))
| ~ big_p(f(f(esk2_0)))
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( big_p(a)
| big_p(a)
| ~ big_p(f(f(esk1_0))) )
& ( big_p(f(esk2_0))
| big_p(a)
| ~ big_p(f(f(esk1_0))) )
& ( ~ big_p(f(f(esk2_0)))
| big_p(a)
| ~ big_p(f(f(esk1_0))) )
& ( big_p(a)
| ~ big_p(esk2_0)
| ~ big_p(f(f(esk1_0))) )
& ( big_p(f(esk2_0))
| ~ big_p(esk2_0)
| ~ big_p(f(f(esk1_0))) )
& ( ~ big_p(f(f(esk2_0)))
| ~ big_p(esk2_0)
| ~ big_p(f(f(esk1_0))) )
& ( big_p(a)
| ~ big_p(f(f(esk2_0)))
| ~ big_p(f(f(esk1_0))) )
& ( big_p(f(esk2_0))
| ~ big_p(f(f(esk2_0)))
| ~ big_p(f(f(esk1_0))) )
& ( ~ big_p(f(f(esk2_0)))
| ~ big_p(f(f(esk2_0)))
| ~ big_p(f(f(esk1_0))) )
& ( ~ big_p(a)
| big_p(X6)
| big_p(f(f(X6)))
| big_p(X5)
| ~ big_p(a)
| big_p(f(f(X5))) )
& ( ~ big_p(a)
| ~ big_p(f(X6))
| big_p(f(f(X6)))
| big_p(X5)
| ~ big_p(a)
| big_p(f(f(X5))) )
& ( ~ big_p(a)
| big_p(X6)
| big_p(f(f(X6)))
| ~ big_p(f(X5))
| ~ big_p(a)
| big_p(f(f(X5))) )
& ( ~ big_p(a)
| ~ big_p(f(X6))
| big_p(f(f(X6)))
| ~ big_p(f(X5))
| ~ big_p(a)
| big_p(f(f(X5))) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
( big_p(X1)
| big_p(f(f(X1)))
| big_p(X2)
| big_p(f(f(X2)))
| ~ big_p(a)
| ~ big_p(a) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( big_p(a)
| big_p(a)
| big_p(a) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( big_p(X2)
| big_p(X1)
| big_p(f(f(X2)))
| big_p(f(f(X1)))
| ~ big_p(a) ),
inference(cn,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
big_p(a),
inference(cn,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( big_p(f(f(X1)))
| big_p(f(f(X2)))
| ~ big_p(a)
| ~ big_p(f(X1))
| ~ big_p(f(X2))
| ~ big_p(a) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( ~ big_p(f(f(esk2_0)))
| ~ big_p(f(f(esk2_0)))
| ~ big_p(f(f(esk1_0))) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( big_p(f(f(X1)))
| big_p(f(f(X2)))
| big_p(X1)
| big_p(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]) ).
cnf(c_0_10,negated_conjecture,
( big_p(f(f(X2)))
| big_p(f(f(X1)))
| ~ big_p(a)
| ~ big_p(f(X2))
| ~ big_p(f(X1)) ),
inference(cn,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( ~ big_p(f(f(esk1_0)))
| ~ big_p(f(f(esk2_0))) ),
inference(cn,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( big_p(f(f(X1)))
| big_p(X1) ),
inference(ef,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( big_p(f(f(X1)))
| big_p(f(f(X2)))
| ~ big_p(f(X2))
| ~ big_p(f(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_6])]) ).
cnf(c_0_14,negated_conjecture,
( big_p(f(esk2_0))
| big_p(f(esk1_0))
| ~ big_p(esk2_0)
| ~ big_p(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
( big_p(f(esk2_0))
| ~ big_p(esk2_0)
| ~ big_p(f(f(esk1_0))) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
( big_p(esk1_0)
| ~ big_p(f(f(esk2_0))) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( big_p(f(f(X1)))
| big_p(f(esk2_0))
| ~ big_p(f(X1))
| ~ big_p(esk1_0)
| ~ big_p(esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( big_p(esk2_0)
| big_p(esk1_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( big_p(f(esk2_0))
| ~ big_p(esk2_0)
| ~ big_p(esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_17]),c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( big_p(f(esk2_0))
| big_p(esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_12]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( big_p(f(f(esk2_0)))
| big_p(f(f(X1)))
| ~ big_p(f(X1))
| ~ big_p(esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_19]),c_0_12]) ).
cnf(c_0_22,negated_conjecture,
( big_p(f(f(esk2_0)))
| big_p(f(f(X1)))
| ~ big_p(f(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_20]),c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( big_p(f(esk1_0))
| ~ big_p(f(f(esk2_0)))
| ~ big_p(f(f(esk2_0)))
| ~ big_p(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_24,negated_conjecture,
big_p(esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_20]),c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( big_p(f(esk1_0))
| ~ big_p(esk1_0)
| ~ big_p(f(f(esk2_0))) ),
inference(cn,[status(thm)],[c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( big_p(f(esk2_0))
| ~ big_p(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
( big_p(f(esk1_0))
| ~ big_p(f(f(esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_24])]) ).
cnf(c_0_28,negated_conjecture,
big_p(f(f(esk2_0))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_26]),c_0_12]) ).
cnf(c_0_29,negated_conjecture,
big_p(f(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_30,negated_conjecture,
~ big_p(f(f(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_28])]) ).
cnf(c_0_31,negated_conjecture,
( big_p(f(f(X1)))
| ~ big_p(f(X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_29]),c_0_30]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SYN084+1 : TPTP v8.1.2. Released v2.0.0.
% 0.04/0.16 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n011.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 2400
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon Oct 2 18:05:38 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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.XPRued0p6U/E---3.1_17940.p
% 0.22/0.51 # Version: 3.1pre001
% 0.22/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # new_bool_3 with pid 18089 completed with status 0
% 0.22/0.51 # Result found by new_bool_3
% 0.22/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.22/0.51 # G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with pid 18093 completed with status 0
% 0.22/0.51 # Result found by G-E--_208_C47_F1_SE_CS_SP_PS_S0Y
% 0.22/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Theorem
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 1
% 0.22/0.51 # Removed by relevancy pruning/SinE : 0
% 0.22/0.51 # Initial clauses : 31
% 0.22/0.51 # Removed in clause preprocessing : 0
% 0.22/0.51 # Initial clauses in saturation : 31
% 0.22/0.51 # Processed clauses : 57
% 0.22/0.51 # ...of these trivial : 18
% 0.22/0.51 # ...subsumed : 7
% 0.22/0.51 # ...remaining for further processing : 32
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 9
% 0.22/0.51 # Backward-rewritten : 7
% 0.22/0.51 # Generated clauses : 38
% 0.22/0.51 # ...of the previous two non-redundant : 36
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 9
% 0.22/0.51 # Paramodulations : 36
% 0.22/0.51 # Factorizations : 2
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Total rewrite steps : 31
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 8
% 0.22/0.51 # Positive orientable unit clauses : 4
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 1
% 0.22/0.51 # Non-unit-clauses : 3
% 0.22/0.51 # Current number of unprocessed clauses: 13
% 0.22/0.51 # ...number of literals in the above : 61
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 24
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 79
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 59
% 0.22/0.51 # Non-unit clause-clause subsumptions : 23
% 0.22/0.51 # Unit Clause-clause subsumption calls : 3
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 6
% 0.22/0.51 # BW rewrite match successes : 3
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 2038
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.006 s
% 0.22/0.51 # System time : 0.001 s
% 0.22/0.51 # Total time : 0.007 s
% 0.22/0.51 # Maximum resident set size: 1752 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.006 s
% 0.22/0.51 # System time : 0.004 s
% 0.22/0.51 # Total time : 0.011 s
% 0.22/0.51 # Maximum resident set size: 1672 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------