TSTP Solution File: SYN078+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN078+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:43 EDT 2023
% Result : Theorem 0.37s 0.52s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 56 ( 9 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 60 ( 22 ~; 24 |; 8 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 15 ( 0 sgn; 7 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel56,conjecture,
( ! [X1] :
( ? [X2] :
( big_p(X2)
& X1 = f(X2) )
=> big_p(X1) )
<=> ! [X3] :
( big_p(X3)
=> big_p(f(X3)) ) ),
file('/export/starexec/sandbox/tmp/tmp.Q7L9c2OUp5/E---3.1_29407.p',pel56) ).
fof(c_0_1,negated_conjecture,
~ ( ! [X1] :
( ? [X2] :
( big_p(X2)
& X1 = f(X2) )
=> big_p(X1) )
<=> ! [X3] :
( big_p(X3)
=> big_p(f(X3)) ) ),
inference(assume_negation,[status(cth)],[pel56]) ).
fof(c_0_2,negated_conjecture,
! [X7,X8,X9] :
( ( big_p(esk3_0)
| big_p(esk2_0) )
& ( ~ big_p(f(esk3_0))
| big_p(esk2_0) )
& ( big_p(esk3_0)
| esk1_0 = f(esk2_0) )
& ( ~ big_p(f(esk3_0))
| esk1_0 = f(esk2_0) )
& ( big_p(esk3_0)
| ~ big_p(esk1_0) )
& ( ~ big_p(f(esk3_0))
| ~ big_p(esk1_0) )
& ( ~ big_p(X8)
| X7 != f(X8)
| big_p(X7)
| ~ big_p(X9)
| big_p(f(X9)) ) ),
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(X2)
| big_p(f(X3))
| ~ big_p(X1)
| X2 != f(X1)
| ~ big_p(X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( big_p(f(X1))
| big_p(f(X2))
| ~ big_p(X2)
| ~ big_p(X1) ),
inference(er,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
( esk1_0 = f(esk2_0)
| ~ big_p(f(esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( big_p(f(X1))
| ~ big_p(X1) ),
inference(ef,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( big_p(esk3_0)
| esk1_0 = f(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( big_p(esk2_0)
| ~ big_p(f(esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( big_p(esk3_0)
| big_p(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
f(esk2_0) = esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_11,negated_conjecture,
big_p(esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_6]),c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( ~ big_p(f(esk3_0))
| ~ big_p(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
big_p(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_10]),c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
~ big_p(f(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_15,negated_conjecture,
( big_p(esk3_0)
| ~ big_p(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
~ big_p(esk3_0),
inference(spm,[status(thm)],[c_0_14,c_0_6]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_13])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : SYN078+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n007.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 2400
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Mon Oct 2 17:51:54 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 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.Q7L9c2OUp5/E---3.1_29407.p
% 0.37/0.52 # Version: 3.1pre001
% 0.37/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.37/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.37/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.52 # Starting sh5l with 300s (1) cores
% 0.37/0.52 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 29555 completed with status 0
% 0.37/0.52 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.37/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.37/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.37/0.52 # No SInE strategy applied
% 0.37/0.52 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.37/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.37/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.37/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.37/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.37/0.52 # Starting sh5l with 136s (1) cores
% 0.37/0.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 29559 completed with status 0
% 0.37/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.37/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.37/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.37/0.52 # No SInE strategy applied
% 0.37/0.52 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.37/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.37/0.52 # Preprocessing time : 0.001 s
% 0.37/0.52 # Presaturation interreduction done
% 0.37/0.52
% 0.37/0.52 # Proof found!
% 0.37/0.52 # SZS status Theorem
% 0.37/0.52 # SZS output start CNFRefutation
% See solution above
% 0.37/0.52 # Parsed axioms : 1
% 0.37/0.52 # Removed by relevancy pruning/SinE : 0
% 0.37/0.52 # Initial clauses : 7
% 0.37/0.52 # Removed in clause preprocessing : 0
% 0.37/0.52 # Initial clauses in saturation : 7
% 0.37/0.52 # Processed clauses : 23
% 0.37/0.52 # ...of these trivial : 0
% 0.37/0.52 # ...subsumed : 0
% 0.37/0.52 # ...remaining for further processing : 22
% 0.37/0.52 # Other redundant clauses eliminated : 1
% 0.37/0.52 # Clauses deleted for lack of memory : 0
% 0.37/0.52 # Backward-subsumed : 4
% 0.37/0.52 # Backward-rewritten : 4
% 0.37/0.52 # Generated clauses : 17
% 0.37/0.52 # ...of the previous two non-redundant : 19
% 0.37/0.52 # ...aggressively subsumed : 0
% 0.37/0.52 # Contextual simplify-reflections : 3
% 0.37/0.52 # Paramodulations : 14
% 0.37/0.52 # Factorizations : 2
% 0.37/0.52 # NegExts : 0
% 0.37/0.52 # Equation resolutions : 1
% 0.37/0.52 # Total rewrite steps : 5
% 0.37/0.52 # Propositional unsat checks : 0
% 0.37/0.52 # Propositional check models : 0
% 0.37/0.52 # Propositional check unsatisfiable : 0
% 0.37/0.52 # Propositional clauses : 0
% 0.37/0.52 # Propositional clauses after purity: 0
% 0.37/0.52 # Propositional unsat core size : 0
% 0.37/0.52 # Propositional preprocessing time : 0.000
% 0.37/0.52 # Propositional encoding time : 0.000
% 0.37/0.52 # Propositional solver time : 0.000
% 0.37/0.52 # Success case prop preproc time : 0.000
% 0.37/0.52 # Success case prop encoding time : 0.000
% 0.37/0.52 # Success case prop solver time : 0.000
% 0.37/0.52 # Current number of processed clauses : 6
% 0.37/0.52 # Positive orientable unit clauses : 3
% 0.37/0.52 # Positive unorientable unit clauses: 0
% 0.37/0.52 # Negative unit clauses : 2
% 0.37/0.52 # Non-unit-clauses : 1
% 0.37/0.52 # Current number of unprocessed clauses: 9
% 0.37/0.52 # ...number of literals in the above : 34
% 0.37/0.52 # Current number of archived formulas : 0
% 0.37/0.52 # Current number of archived clauses : 15
% 0.37/0.52 # Clause-clause subsumption calls (NU) : 9
% 0.37/0.52 # Rec. Clause-clause subsumption calls : 8
% 0.37/0.52 # Non-unit clause-clause subsumptions : 5
% 0.37/0.52 # Unit Clause-clause subsumption calls : 3
% 0.37/0.52 # Rewrite failures with RHS unbound : 0
% 0.37/0.52 # BW rewrite match attempts : 3
% 0.37/0.52 # BW rewrite match successes : 3
% 0.37/0.52 # Condensation attempts : 0
% 0.37/0.52 # Condensation successes : 0
% 0.37/0.52 # Termbank termtop insertions : 563
% 0.37/0.52
% 0.37/0.52 # -------------------------------------------------
% 0.37/0.52 # User time : 0.002 s
% 0.37/0.52 # System time : 0.002 s
% 0.37/0.52 # Total time : 0.004 s
% 0.37/0.52 # Maximum resident set size: 1696 pages
% 0.37/0.52
% 0.37/0.52 # -------------------------------------------------
% 0.37/0.52 # User time : 0.011 s
% 0.37/0.52 # System time : 0.006 s
% 0.37/0.52 # Total time : 0.017 s
% 0.37/0.52 # Maximum resident set size: 1668 pages
% 0.37/0.52 % E---3.1 exiting
% 0.37/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------