TSTP Solution File: SYN069+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN069+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:10 EDT 2023
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 5 unt; 0 def)
% Number of atoms : 89 ( 0 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 102 ( 37 ~; 38 |; 23 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 34 ( 7 sgn; 13 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel45_1,axiom,
! [X1] :
( ( big_f(X1)
& ! [X2] :
( ( big_g(X2)
& big_h(X1,X2) )
=> big_j(X1,X2) ) )
=> ! [X3] :
( big_g(X3)
& big_h(X1,X3)
& big_k(X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.EuPcHFrml9/E---3.1_28672.p',pel45_1) ).
fof(pel45_3,axiom,
? [X1] :
( big_f(X1)
& ! [X2] :
( big_h(X1,X2)
=> big_l(X2) )
& ! [X3] :
( ( big_g(X3)
& big_h(X1,X3) )
=> big_j(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.EuPcHFrml9/E---3.1_28672.p',pel45_3) ).
fof(pel45_2,axiom,
~ ? [X2] :
( big_l(X2)
& big_k(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.EuPcHFrml9/E---3.1_28672.p',pel45_2) ).
fof(pel45,conjecture,
? [X1] :
( big_f(X1)
& ~ ? [X2] :
( big_g(X2)
& big_h(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.EuPcHFrml9/E---3.1_28672.p',pel45) ).
fof(c_0_4,plain,
! [X6,X8,X9,X10] :
( ( big_g(X8)
| big_g(esk2_1(X6))
| ~ big_f(X6) )
& ( big_h(X6,X9)
| big_g(esk2_1(X6))
| ~ big_f(X6) )
& ( big_k(X10)
| big_g(esk2_1(X6))
| ~ big_f(X6) )
& ( big_g(X8)
| big_h(X6,esk2_1(X6))
| ~ big_f(X6) )
& ( big_h(X6,X9)
| big_h(X6,esk2_1(X6))
| ~ big_f(X6) )
& ( big_k(X10)
| big_h(X6,esk2_1(X6))
| ~ big_f(X6) )
& ( big_g(X8)
| ~ big_j(X6,esk2_1(X6))
| ~ big_f(X6) )
& ( big_h(X6,X9)
| ~ big_j(X6,esk2_1(X6))
| ~ big_f(X6) )
& ( big_k(X10)
| ~ big_j(X6,esk2_1(X6))
| ~ big_f(X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[pel45_1])])])])])]) ).
fof(c_0_5,plain,
! [X12,X13] :
( big_f(esk3_0)
& ( ~ big_h(esk3_0,X12)
| big_l(X12) )
& ( ~ big_g(X13)
| ~ big_h(esk3_0,X13)
| big_j(esk3_0,X13) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel45_3])])])]) ).
cnf(c_0_6,plain,
( big_g(X1)
| big_g(esk2_1(X2))
| ~ big_f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
big_f(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( big_g(esk2_1(esk3_0))
| big_g(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
fof(c_0_9,plain,
! [X14] :
( ~ big_l(X14)
| ~ big_k(X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel45_2])]) ).
cnf(c_0_10,plain,
( big_k(X1)
| ~ big_j(X2,esk2_1(X2))
| ~ big_f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,plain,
( big_j(esk3_0,X1)
| ~ big_g(X1)
| ~ big_h(esk3_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
big_g(esk2_1(esk3_0)),
inference(ef,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ big_l(X1)
| ~ big_k(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( big_l(X1)
| ~ big_h(esk3_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( big_k(X1)
| big_h(X2,esk2_1(X2))
| ~ big_f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,plain,
( big_k(X1)
| ~ big_h(esk3_0,esk2_1(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_7]),c_0_12])]) ).
fof(c_0_17,negated_conjecture,
~ ? [X1] :
( big_f(X1)
& ~ ? [X2] :
( big_g(X2)
& big_h(X1,X2) ) ),
inference(assume_negation,[status(cth)],[pel45]) ).
cnf(c_0_18,plain,
( ~ big_k(X1)
| ~ big_h(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
big_k(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_7]),c_0_16]) ).
fof(c_0_20,negated_conjecture,
! [X4] :
( ( big_g(esk1_1(X4))
| ~ big_f(X4) )
& ( big_h(X4,esk1_1(X4))
| ~ big_f(X4) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
cnf(c_0_21,plain,
~ big_h(esk3_0,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
( big_h(X1,esk1_1(X1))
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN069+1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n002.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 : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 18:32:44 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.EuPcHFrml9/E---3.1_28672.p
% 0.19/0.49 # Version: 3.1pre001
% 0.19/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # new_bool_3 with pid 28765 completed with status 0
% 0.19/0.49 # Result found by new_bool_3
% 0.19/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # SAT001_MinMin_p005000_rr_RG with pid 28773 completed with status 0
% 0.19/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 4
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 15
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 15
% 0.19/0.49 # Processed clauses : 42
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 1
% 0.19/0.49 # ...remaining for further processing : 41
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 4
% 0.19/0.49 # Backward-rewritten : 14
% 0.19/0.49 # Generated clauses : 16
% 0.19/0.49 # ...of the previous two non-redundant : 16
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 2
% 0.19/0.49 # Paramodulations : 14
% 0.19/0.49 # Factorizations : 2
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Total rewrite steps : 26
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 8
% 0.19/0.49 # Positive orientable unit clauses : 3
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 2
% 0.19/0.49 # Non-unit-clauses : 3
% 0.19/0.49 # Current number of unprocessed clauses: 2
% 0.19/0.49 # ...number of literals in the above : 3
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 33
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 73
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 64
% 0.19/0.49 # Non-unit clause-clause subsumptions : 3
% 0.19/0.49 # Unit Clause-clause subsumption calls : 10
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 8
% 0.19/0.49 # BW rewrite match successes : 8
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 1035
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.005 s
% 0.19/0.49 # System time : 0.002 s
% 0.19/0.49 # Total time : 0.007 s
% 0.19/0.49 # Maximum resident set size: 1732 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.005 s
% 0.19/0.49 # System time : 0.005 s
% 0.19/0.49 # Total time : 0.010 s
% 0.19/0.49 # Maximum resident set size: 1676 pages
% 0.19/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------