TSTP Solution File: SYN059+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN059+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:21 EDT 2023
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 48 ( 13 unt; 0 def)
% Number of atoms : 182 ( 0 equ)
% Maximal formula atoms : 60 ( 3 avg)
% Number of connectives : 219 ( 85 ~; 105 |; 21 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 29 ( 8 sgn; 12 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel29,conjecture,
( ( ! [X1] :
( big_f(X1)
=> big_h(X1) )
& ! [X3] :
( big_g(X3)
=> big_j(X3) ) )
<=> ! [X4,X2] :
( ( big_f(X4)
& big_g(X2) )
=> ( big_h(X4)
& big_j(X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ROaGUERzlT/E---3.1_1055.p',pel29) ).
fof(pel29_2,axiom,
? [X2] : big_g(X2),
file('/export/starexec/sandbox/tmp/tmp.ROaGUERzlT/E---3.1_1055.p',pel29_2) ).
fof(pel29_1,axiom,
? [X1] : big_f(X1),
file('/export/starexec/sandbox/tmp/tmp.ROaGUERzlT/E---3.1_1055.p',pel29_1) ).
fof(c_0_3,negated_conjecture,
~ ( ( ! [X1] :
( big_f(X1)
=> big_h(X1) )
& ! [X3] :
( big_g(X3)
=> big_j(X3) ) )
<=> ! [X4,X2] :
( ( big_f(X4)
& big_g(X2) )
=> ( big_h(X4)
& big_j(X2) ) ) ),
inference(assume_negation,[status(cth)],[pel29]) ).
fof(c_0_4,negated_conjecture,
! [X11,X12,X13,X14] :
( ( big_f(esk5_0)
| big_g(esk4_0)
| big_f(esk3_0) )
& ( big_g(esk6_0)
| big_g(esk4_0)
| big_f(esk3_0) )
& ( ~ big_h(esk5_0)
| ~ big_j(esk6_0)
| big_g(esk4_0)
| big_f(esk3_0) )
& ( big_f(esk5_0)
| ~ big_j(esk4_0)
| big_f(esk3_0) )
& ( big_g(esk6_0)
| ~ big_j(esk4_0)
| big_f(esk3_0) )
& ( ~ big_h(esk5_0)
| ~ big_j(esk6_0)
| ~ big_j(esk4_0)
| big_f(esk3_0) )
& ( big_f(esk5_0)
| big_g(esk4_0)
| ~ big_h(esk3_0) )
& ( big_g(esk6_0)
| big_g(esk4_0)
| ~ big_h(esk3_0) )
& ( ~ big_h(esk5_0)
| ~ big_j(esk6_0)
| big_g(esk4_0)
| ~ big_h(esk3_0) )
& ( big_f(esk5_0)
| ~ big_j(esk4_0)
| ~ big_h(esk3_0) )
& ( big_g(esk6_0)
| ~ big_j(esk4_0)
| ~ big_h(esk3_0) )
& ( ~ big_h(esk5_0)
| ~ big_j(esk6_0)
| ~ big_j(esk4_0)
| ~ big_h(esk3_0) )
& ( big_h(X13)
| ~ big_f(X13)
| ~ big_g(X14)
| ~ big_f(X11)
| big_h(X11) )
& ( big_j(X14)
| ~ big_f(X13)
| ~ big_g(X14)
| ~ big_f(X11)
| big_h(X11) )
& ( big_h(X13)
| ~ big_f(X13)
| ~ big_g(X14)
| ~ big_g(X12)
| big_j(X12) )
& ( big_j(X14)
| ~ big_f(X13)
| ~ big_g(X14)
| ~ big_g(X12)
| big_j(X12) ) ),
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_3])])])])]) ).
cnf(c_0_5,negated_conjecture,
( big_h(X1)
| big_h(X3)
| ~ big_f(X1)
| ~ big_g(X2)
| ~ big_f(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
big_g(esk2_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[pel29_2])]) ).
cnf(c_0_7,negated_conjecture,
( big_h(X1)
| ~ big_g(X2)
| ~ big_f(X1) ),
inference(ef,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
big_g(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( big_j(X1)
| big_j(X3)
| ~ big_f(X2)
| ~ big_g(X1)
| ~ big_g(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( big_f(esk5_0)
| big_g(esk4_0)
| ~ big_h(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( big_h(X1)
| ~ big_f(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( big_f(esk5_0)
| big_g(esk4_0)
| big_f(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( big_f(esk5_0)
| ~ big_j(esk4_0)
| ~ big_h(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
( big_f(esk5_0)
| big_f(esk3_0)
| ~ big_j(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
( big_g(esk6_0)
| big_g(esk4_0)
| ~ big_h(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
( big_g(esk6_0)
| big_g(esk4_0)
| big_f(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( big_j(X1)
| ~ big_g(X1)
| ~ big_f(X2) ),
inference(ef,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
( big_g(esk4_0)
| big_f(esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( big_f(esk5_0)
| ~ big_j(esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_11]),c_0_14]) ).
fof(c_0_20,plain,
big_f(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[pel29_1])]) ).
cnf(c_0_21,negated_conjecture,
( big_g(esk4_0)
| ~ big_h(esk5_0)
| ~ big_j(esk6_0)
| ~ big_h(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_22,negated_conjecture,
( big_g(esk4_0)
| big_g(esk6_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( big_f(esk5_0)
| ~ big_f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_24,plain,
big_f(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( big_g(esk4_0)
| ~ big_j(esk6_0)
| ~ big_h(esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_11]),c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( big_j(esk6_0)
| big_g(esk4_0)
| ~ big_f(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
big_f(esk5_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( big_g(esk4_0)
| ~ big_j(esk6_0)
| ~ big_f(esk3_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_11]) ).
cnf(c_0_29,negated_conjecture,
( big_j(esk6_0)
| big_g(esk4_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( big_g(esk4_0)
| big_f(esk3_0)
| ~ big_h(esk5_0)
| ~ big_j(esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_31,negated_conjecture,
( big_g(esk4_0)
| ~ big_f(esk3_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( big_g(esk4_0)
| ~ big_h(esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_29]),c_0_31]) ).
cnf(c_0_33,negated_conjecture,
( ~ big_h(esk5_0)
| ~ big_j(esk6_0)
| ~ big_j(esk4_0)
| ~ big_h(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_34,negated_conjecture,
big_g(esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_11]),c_0_27])]) ).
cnf(c_0_35,negated_conjecture,
( ~ big_j(esk4_0)
| ~ big_j(esk6_0)
| ~ big_h(esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_11]),c_0_13]) ).
cnf(c_0_36,negated_conjecture,
( big_g(esk6_0)
| ~ big_j(esk4_0)
| ~ big_h(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_37,negated_conjecture,
( big_g(esk6_0)
| big_f(esk3_0)
| ~ big_j(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_38,negated_conjecture,
( big_j(esk4_0)
| ~ big_f(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( big_f(esk3_0)
| ~ big_h(esk5_0)
| ~ big_j(esk6_0)
| ~ big_j(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_40,negated_conjecture,
( ~ big_j(esk4_0)
| ~ big_j(esk6_0)
| ~ big_f(esk3_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_11]) ).
cnf(c_0_41,negated_conjecture,
( big_g(esk6_0)
| ~ big_j(esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_11]),c_0_37]) ).
cnf(c_0_42,negated_conjecture,
big_j(esk4_0),
inference(spm,[status(thm)],[c_0_38,c_0_27]) ).
cnf(c_0_43,negated_conjecture,
( ~ big_j(esk4_0)
| ~ big_j(esk6_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_11]),c_0_14]),c_0_40]) ).
cnf(c_0_44,negated_conjecture,
big_g(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]) ).
cnf(c_0_45,negated_conjecture,
~ big_j(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_42])]) ).
cnf(c_0_46,negated_conjecture,
~ big_f(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_44]),c_0_45]) ).
cnf(c_0_47,plain,
$false,
inference(sr,[status(thm)],[c_0_24,c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN059+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 18:32:21 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.ROaGUERzlT/E---3.1_1055.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1137 completed with status 0
% 0.20/0.50 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.50 # Starting sh5l with 136s (1) cores
% 0.20/0.50 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1143 completed with status 0
% 0.20/0.50 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.50 # Preprocessing time : 0.002 s
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 3
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 18
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 18
% 0.20/0.50 # Processed clauses : 46
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 46
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 28
% 0.20/0.50 # Backward-rewritten : 9
% 0.20/0.50 # Generated clauses : 48
% 0.20/0.50 # ...of the previous two non-redundant : 48
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 10
% 0.20/0.50 # Paramodulations : 42
% 0.20/0.50 # Factorizations : 4
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Total rewrite steps : 10
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 7
% 0.20/0.50 # Positive orientable unit clauses : 5
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 2
% 0.20/0.50 # Non-unit-clauses : 0
% 0.20/0.50 # Current number of unprocessed clauses: 0
% 0.20/0.50 # ...number of literals in the above : 0
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 39
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 37
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 37
% 0.20/0.50 # Non-unit clause-clause subsumptions : 32
% 0.20/0.50 # Unit Clause-clause subsumption calls : 9
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 4
% 0.20/0.50 # BW rewrite match successes : 4
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 1321
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.007 s
% 0.20/0.50 # Maximum resident set size: 1732 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.022 s
% 0.20/0.50 # System time : 0.010 s
% 0.20/0.50 # Total time : 0.032 s
% 0.20/0.50 # Maximum resident set size: 1672 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------