TSTP Solution File: SYN070+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN070+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 10:06:24 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 6 unt; 0 def)
% Number of atoms : 94 ( 0 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 105 ( 39 ~; 37 |; 19 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 44 ( 13 sgn 16 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel46,conjecture,
! [X1] :
( big_f(X1)
=> big_g(X1) ),
file('/export/starexec/sandbox/tmp/tmp.WoB67zrXh7/E---3.1_10166.p',pel46) ).
fof(pel46_2,axiom,
( ? [X1] :
( big_f(X1)
& ~ big_g(X1) )
=> ? [X3] :
( big_f(X3)
& ~ big_g(X3)
& ! [X2] :
( ( big_f(X2)
& ~ big_g(X2) )
=> big_j(X3,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WoB67zrXh7/E---3.1_10166.p',pel46_2) ).
fof(pel46_3,axiom,
! [X1,X2] :
( ( big_f(X1)
& big_f(X2)
& big_h(X1,X2) )
=> ~ big_j(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.WoB67zrXh7/E---3.1_10166.p',pel46_3) ).
fof(pel46_1,axiom,
! [X1,X2] :
( ( big_f(X1)
& ( ( big_f(X2)
& big_h(X2,X1) )
=> big_g(X2) ) )
=> big_g(X1) ),
file('/export/starexec/sandbox/tmp/tmp.WoB67zrXh7/E---3.1_10166.p',pel46_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( big_f(X1)
=> big_g(X1) ),
inference(assume_negation,[status(cth)],[pel46]) ).
fof(c_0_5,plain,
( ? [X1] :
( big_f(X1)
& ~ big_g(X1) )
=> ? [X3] :
( big_f(X3)
& ~ big_g(X3)
& ! [X2] :
( ( big_f(X2)
& ~ big_g(X2) )
=> big_j(X3,X2) ) ) ),
inference(fof_simplification,[status(thm)],[pel46_2]) ).
fof(c_0_6,plain,
! [X1,X2] :
( ( big_f(X1)
& big_f(X2)
& big_h(X1,X2) )
=> ~ big_j(X2,X1) ),
inference(fof_simplification,[status(thm)],[pel46_3]) ).
fof(c_0_7,plain,
! [X5,X6] :
( ( big_f(X6)
| ~ big_f(X5)
| big_g(X5) )
& ( big_h(X6,X5)
| ~ big_f(X5)
| big_g(X5) )
& ( ~ big_g(X6)
| ~ big_f(X5)
| big_g(X5) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel46_1])])])]) ).
fof(c_0_8,negated_conjecture,
( big_f(esk1_0)
& ~ big_g(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_9,plain,
! [X7,X9] :
( ( big_f(esk2_0)
| ~ big_f(X7)
| big_g(X7) )
& ( ~ big_g(esk2_0)
| ~ big_f(X7)
| big_g(X7) )
& ( ~ big_f(X9)
| big_g(X9)
| big_j(esk2_0,X9)
| ~ big_f(X7)
| big_g(X7) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])]) ).
fof(c_0_10,plain,
! [X10,X11] :
( ~ big_f(X10)
| ~ big_f(X11)
| ~ big_h(X10,X11)
| ~ big_j(X11,X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_11,plain,
( big_f(X1)
| big_g(X2)
| ~ big_f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
big_f(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
~ big_g(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( big_g(X1)
| big_j(esk2_0,X1)
| big_g(X2)
| ~ big_f(X1)
| ~ big_f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( big_g(X2)
| ~ big_g(X1)
| ~ big_f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( ~ big_f(X1)
| ~ big_f(X2)
| ~ big_h(X1,X2)
| ~ big_j(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
big_f(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_18,plain,
( big_j(esk2_0,X1)
| big_g(X2)
| ~ big_f(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_14,c_0_11]),c_0_15]) ).
cnf(c_0_19,plain,
( ~ big_j(X1,X2)
| ~ big_h(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17])]) ).
cnf(c_0_20,plain,
( big_j(esk2_0,X1)
| big_g(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_17])]) ).
cnf(c_0_21,plain,
( big_h(X1,X2)
| big_g(X2)
| ~ big_f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,plain,
( big_g(X1)
| ~ big_h(X2,esk2_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( big_g(X1)
| big_h(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_17])]) ).
cnf(c_0_24,plain,
( big_g(X1)
| ~ big_g(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_17])]) ).
cnf(c_0_25,plain,
big_g(esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_26,plain,
big_g(X1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN070+1 : TPTP v8.1.2. Released v2.0.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 11:01:18 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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.WoB67zrXh7/E---3.1_10166.p
% 0.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # new_bool_3 with pid 10246 completed with status 0
% 0.20/0.49 # Result found by new_bool_3
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 10249 completed with status 0
% 0.20/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 4
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 9
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 9
% 0.20/0.49 # Processed clauses : 21
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 21
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 3
% 0.20/0.49 # Backward-rewritten : 8
% 0.20/0.49 # Generated clauses : 5
% 0.20/0.49 # ...of the previous two non-redundant : 6
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 3
% 0.20/0.49 # Paramodulations : 5
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 13
% 0.20/0.49 # ...of those cached : 6
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 3
% 0.20/0.49 # Positive orientable unit clauses : 2
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 0
% 0.20/0.49 # Non-unit-clauses : 1
% 0.20/0.49 # Current number of unprocessed clauses: 1
% 0.20/0.49 # ...number of literals in the above : 2
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 18
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 6
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 6
% 0.20/0.49 # Non-unit clause-clause subsumptions : 5
% 0.20/0.49 # Unit Clause-clause subsumption calls : 2
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 7
% 0.20/0.49 # BW rewrite match successes : 7
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 703
% 0.20/0.49 # Search garbage collected termcells : 154
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.006 s
% 0.20/0.49 # Maximum resident set size: 1756 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1688 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------