TSTP Solution File: SYN328+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN328+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:14:26 EDT 2023
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 23 ( 4 unt; 0 def)
% Number of atoms : 97 ( 0 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 110 ( 36 ~; 40 |; 14 &)
% ( 6 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 0 con; 1-1 aty)
% Number of variables : 26 ( 3 sgn; 5 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(church_46_12_3,conjecture,
? [X1] :
! [X2,X3] :
( ( ( big_f(X2)
=> big_g(X2) )
<=> big_f(X1) )
=> ( ( ( big_f(X2)
=> big_h(X2) )
<=> big_g(X1) )
=> ( ( ( ( big_f(X2)
=> big_g(X2) )
=> big_h(X2) )
<=> big_h(X1) )
=> ( big_f(X3)
& big_g(X3)
& big_h(X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.UyaJNRG2nJ/E---3.1_24082.p',church_46_12_3) ).
fof(c_0_1,negated_conjecture,
~ ? [X1] :
! [X2,X3] :
( ( ( big_f(X2)
=> big_g(X2) )
<=> big_f(X1) )
=> ( ( ( big_f(X2)
=> big_h(X2) )
<=> big_g(X1) )
=> ( ( ( ( big_f(X2)
=> big_g(X2) )
=> big_h(X2) )
<=> big_h(X1) )
=> ( big_f(X3)
& big_g(X3)
& big_h(X3) ) ) ) ),
inference(assume_negation,[status(cth)],[church_46_12_3]) ).
fof(c_0_2,negated_conjecture,
! [X4] :
( ( big_f(esk1_1(X4))
| big_f(X4) )
& ( ~ big_g(esk1_1(X4))
| big_f(X4) )
& ( ~ big_f(X4)
| ~ big_f(esk1_1(X4))
| big_g(esk1_1(X4)) )
& ( big_f(esk1_1(X4))
| big_g(X4) )
& ( ~ big_h(esk1_1(X4))
| big_g(X4) )
& ( ~ big_g(X4)
| ~ big_f(esk1_1(X4))
| big_h(esk1_1(X4)) )
& ( ~ big_f(esk1_1(X4))
| big_g(esk1_1(X4))
| big_h(X4) )
& ( ~ big_h(esk1_1(X4))
| big_h(X4) )
& ( big_f(esk1_1(X4))
| big_h(esk1_1(X4))
| ~ big_h(X4) )
& ( ~ big_g(esk1_1(X4))
| big_h(esk1_1(X4))
| ~ big_h(X4) )
& ( ~ big_f(esk2_1(X4))
| ~ big_g(esk3_1(X4))
| ~ big_h(esk4_1(X4)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
( big_f(X1)
| ~ big_g(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( big_g(esk1_1(X1))
| big_h(X1)
| ~ big_f(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( big_f(esk1_1(X1))
| big_f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( big_h(X1)
| ~ big_h(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( big_h(X1)
| big_f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( big_h(esk1_1(X1))
| ~ big_g(X1)
| ~ big_f(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( big_h(X1)
| big_f(esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( big_g(X1)
| ~ big_h(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( big_h(esk1_1(X1))
| ~ big_g(esk1_1(X1))
| ~ big_h(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( big_g(esk1_1(X1))
| ~ big_f(X1)
| ~ big_f(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
( ~ big_f(esk2_1(X1))
| ~ big_g(esk3_1(X1))
| ~ big_h(esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( big_h(esk1_1(esk1_1(X1)))
| big_h(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_4]),c_0_9]),c_0_7]) ).
cnf(c_0_15,negated_conjecture,
( big_f(X1)
| ~ big_h(esk1_1(esk1_1(X1))) ),
inference(spm,[status(thm)],[c_0_3,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( big_h(esk1_1(X1))
| ~ big_h(X1)
| ~ big_f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( ~ big_h(esk1_1(esk3_1(X1)))
| ~ big_h(esk4_1(X1))
| ~ big_f(esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_18,negated_conjecture,
big_h(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_14]),c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( big_f(X1)
| ~ big_h(esk1_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_5]) ).
cnf(c_0_20,negated_conjecture,
~ big_f(esk2_1(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
big_f(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_18])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN328+1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n021.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 18:46:14 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 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.UyaJNRG2nJ/E---3.1_24082.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # new_bool_3 with pid 24161 completed with status 0
% 0.17/0.46 # Result found by new_bool_3
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.46 # SAT001_MinMin_p005000_rr_RG with pid 24165 completed with status 0
% 0.17/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 1
% 0.17/0.46 # Removed by relevancy pruning/SinE : 0
% 0.17/0.46 # Initial clauses : 11
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 11
% 0.17/0.46 # Processed clauses : 46
% 0.17/0.46 # ...of these trivial : 0
% 0.17/0.46 # ...subsumed : 10
% 0.17/0.46 # ...remaining for further processing : 36
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 1
% 0.17/0.46 # Backward-rewritten : 22
% 0.17/0.46 # Generated clauses : 30
% 0.17/0.46 # ...of the previous two non-redundant : 30
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 7
% 0.17/0.46 # Paramodulations : 30
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 0
% 0.17/0.46 # Total rewrite steps : 31
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 2
% 0.17/0.46 # Positive orientable unit clauses : 2
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 0
% 0.17/0.46 # Non-unit-clauses : 0
% 0.17/0.46 # Current number of unprocessed clauses: 5
% 0.17/0.46 # ...number of literals in the above : 10
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 34
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 51
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 50
% 0.17/0.46 # Non-unit clause-clause subsumptions : 14
% 0.17/0.46 # Unit Clause-clause subsumption calls : 1
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 10
% 0.17/0.46 # BW rewrite match successes : 10
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 1437
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.002 s
% 0.17/0.46 # System time : 0.003 s
% 0.17/0.46 # Total time : 0.005 s
% 0.17/0.46 # Maximum resident set size: 1736 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.002 s
% 0.17/0.46 # System time : 0.005 s
% 0.17/0.46 # Total time : 0.007 s
% 0.17/0.46 # Maximum resident set size: 1672 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------