TSTP Solution File: SYN084+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : n024.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:29:14 EDT 2023
% Result : Timeout 0.25s 300.13s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 27 ( 8 unt; 0 def)
% Number of atoms : 197 ( 0 equ)
% Maximal formula atoms : 114 ( 7 avg)
% Number of connectives : 267 ( 97 ~; 130 |; 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 : 16 ( 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/sandbox/tmp/tmp.B9xToHANfg/E---3.1_9631.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(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_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(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_6,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_7,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_3]) ).
cnf(c_0_8,negated_conjecture,
big_p(a),
inference(cn,[status(thm)],[c_0_4]) ).
cnf(c_0_9,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_5]) ).
cnf(c_0_10,negated_conjecture,
( ~ big_p(f(f(esk1_0)))
| ~ big_p(f(f(esk2_0))) ),
inference(cn,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( big_p(f(f(X1)))
| ~ big_p(f(X1)) ),
inference(condense,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])])]) ).
cnf(c_0_12,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_13,negated_conjecture,
( big_p(f(f(X1)))
| big_p(X1) ),
inference(condense,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ big_p(f(f(esk2_0)))
| ~ big_p(f(esk1_0)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( big_p(f(esk1_0))
| ~ big_p(esk1_0)
| ~ big_p(f(f(esk2_0))) ),
inference(cn,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( big_p(esk1_0)
| ~ big_p(f(f(esk2_0))) ),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ big_p(f(f(esk2_0))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,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_19,negated_conjecture,
big_p(esk2_0),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
~ big_p(f(esk2_0)),
inference(spm,[status(thm)],[c_0_17,c_0_11]) ).
cnf(c_0_21,negated_conjecture,
( big_p(f(esk2_0))
| big_p(esk1_0)
| ~ big_p(esk2_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_22,negated_conjecture,
~ big_p(f(f(esk1_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),c_0_20]) ).
cnf(c_0_23,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_24,negated_conjecture,
big_p(esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_19])]),c_0_20]) ).
cnf(c_0_25,negated_conjecture,
~ big_p(f(esk1_0)),
inference(spm,[status(thm)],[c_0_22,c_0_11]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_19])]),c_0_24])]),c_0_20]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SYN084+1 : TPTP v8.1.2. Released v2.0.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n024.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 18:03:26 EDT 2023
% 0.15/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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.B9xToHANfg/E---3.1_9631.p
% 0.25/300.13 # Version: 3.1pre001
% 0.25/300.13 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/300.13 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.25/300.13 # Starting new_bool_1 with 300s (1) cores
% 0.25/300.13 # Starting sh5l with 300s (1) cores
% 0.25/300.13 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 9742 completed with status 0
% 0.25/300.13 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.25/300.13 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/300.13 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/300.13 # No SInE strategy applied
% 0.25/300.13 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.25/300.13 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/300.13 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.25/300.13 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.25/300.13 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.25/300.13 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with 136s (1) cores
% 0.25/300.13 # Starting new_bool_3 with 136s (1) cores
% 0.25/300.13 # G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with pid 9752 completed with status 0
% 0.25/300.13 # Result found by G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y
% 0.25/300.13 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/300.13 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/300.13 # No SInE strategy applied
% 0.25/300.13 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.25/300.13 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/300.13 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.25/300.13 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.25/300.13 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.25/300.13 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with 136s (1) cores
% 0.25/300.13 # Preprocessing time : 0.001 s
% 0.25/300.13
% 0.25/300.13 # Proof found!
% 0.25/300.13 # SZS status Theorem
% 0.25/300.13 # SZS output start CNFRefutation
% See solution above
% 0.25/300.13 # Parsed axioms : 1
% 0.25/300.13 # Removed by relevancy pruning/SinE : 0
% 0.25/300.13 # Initial clauses : 31
% 0.25/300.13 # Removed in clause preprocessing : 0
% 0.25/300.13 # Initial clauses in saturation : 31
% 0.25/300.13 # Processed clauses : 41
% 0.25/300.13 # ...of these trivial : 18
% 0.25/300.13 # ...subsumed : 6
% 0.25/300.13 # ...remaining for further processing : 16
% 0.25/300.13 # Other redundant clauses eliminated : 0
% 0.25/300.13 # Clauses deleted for lack of memory : 0
% 0.25/300.13 # Backward-subsumed : 4
% 0.25/300.13 # Backward-rewritten : 3
% 0.25/300.13 # Generated clauses : 10
% 0.25/300.13 # ...of the previous two non-redundant : 12
% 0.25/300.13 # ...aggressively subsumed : 0
% 0.25/300.13 # Contextual simplify-reflections : 1
% 0.25/300.13 # Paramodulations : 10
% 0.25/300.13 # Factorizations : 0
% 0.25/300.13 # NegExts : 0
% 0.25/300.13 # Equation resolutions : 0
% 0.25/300.13 # Total rewrite steps : 27
% 0.25/300.13 # Propositional unsat checks : 0
% 0.25/300.13 # Propositional check models : 0
% 0.25/300.13 # Propositional check unsatisfiable : 0
% 0.25/300.13 # Propositional clauses : 0
% 0.25/300.13 # Propositional clauses after purity: 0
% 0.25/300.13 # Propositional unsat core size : 0
% 0.25/300.13 # Propositional preprocessing time : 0.000
% 0.25/300.13 # Propositional encoding time : 0.000
% 0.25/300.13 # Propositional solver time : 0.000
% 0.25/300.13 # Success case prop preproc time : 0.000
% 0.25/300.13 # Success case prop encoding time : 0.000
% 0.25/300.13 # Success case prop solver time : 0.000
% 0.25/300.13 # Current number of processed clauses : 9
% 0.25/300.13 # Positive orientable unit clauses : 3
% 0.25/300.13 # Positive unorientable unit clauses: 0
% 0.25/300.13 # Negative unit clauses : 4
% 0.25/300.13 # Non-unit-clauses : 2
% 0.25/300.13 # Current number of unprocessed clauses: 0
% 0.25/300.13 # ...number of literals in the above : 0
% 0.25/300.13 # Current number of archived formulas : 0
% 0.25/300.13 # Current number of archived clauses : 7
% 0.25/300.13 # Clause-clause subsumption calls (NU) : 21
% 0.25/300.13 # Rec. Clause-clause subsumption calls : 19
% 0.25/300.13 # Non-unit clause-clause subsumptions : 9
% 0.25/300.13 # Unit Clause-clause subsumption calls : 7
% 0.25/300.13 # Rewrite failures with RHS unbound : 0
% 0.25/300.13 # BW rewrite match attempts : 1
% 0.25/300.13 # BW rewrite match successes : 1
% 0.25/300.13 # Condensation attempts : 41
% 0.25/300.13 # Condensation successes : 2
% 0.25/300.13 # Termbank termtop insertions : 1545
% 0.25/300.13
% 0.25/300.13 # -------------------------------------------------
% 0.25/300.13 # User time : 0.003 s
% 0.25/300.13 # System time : 0.001 s
% 0.25/300.13 # Total time : 0.005 s
% 0.25/300.13 # Maximum resident set size: 1736 pages
% 0.25/300.13
% 0.25/300.13 # -------------------------------------------------
% 0.25/300.13 # User time : 0.013 s
% 0.25/300.13 # System time : 0.006 s
% 0.25/300.13 # Total time : 0.019 s
% 0.25/300.13 # Maximum resident set size: 1672 pages
% 0.25/300.13 % E---3.1 exiting
%------------------------------------------------------------------------------