TSTP Solution File: SYN365+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN365+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:30:06 EDT 2023
% Result : Theorem 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 47 ( 16 ~; 10 |; 13 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 18 ( 0 sgn; 9 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(x2116,conjecture,
( ( ! [X1] :
? [X2] :
( big_p(X1)
=> ( big_r(X1,g(h(X2)))
& big_p(X2) ) )
& ! [X3] :
( big_p(X3)
=> ( big_p(g(X3))
& big_p(h(X3)) ) ) )
=> ! [X1] :
( big_p(X1)
=> ? [X2] :
( big_r(X1,X2)
& big_p(X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.siGVEoTHaj/E---3.1_16321.p',x2116) ).
fof(c_0_1,negated_conjecture,
~ ( ( ! [X1] :
? [X2] :
( big_p(X1)
=> ( big_r(X1,g(h(X2)))
& big_p(X2) ) )
& ! [X3] :
( big_p(X3)
=> ( big_p(g(X3))
& big_p(h(X3)) ) ) )
=> ! [X1] :
( big_p(X1)
=> ? [X2] :
( big_r(X1,X2)
& big_p(X2) ) ) ),
inference(assume_negation,[status(cth)],[x2116]) ).
fof(c_0_2,negated_conjecture,
! [X4,X6,X8] :
( ( big_r(X4,g(h(esk1_1(X4))))
| ~ big_p(X4) )
& ( big_p(esk1_1(X4))
| ~ big_p(X4) )
& ( big_p(g(X6))
| ~ big_p(X6) )
& ( big_p(h(X6))
| ~ big_p(X6) )
& big_p(esk2_0)
& ( ~ big_r(esk2_0,X8)
| ~ big_p(X8) ) ),
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)],[c_0_1])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( ~ big_r(esk2_0,X1)
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( big_r(X1,g(h(esk1_1(X1))))
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
big_p(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
~ big_p(g(h(esk1_1(esk2_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5])]) ).
cnf(c_0_7,negated_conjecture,
( big_p(g(X1))
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
~ big_p(h(esk1_1(esk2_0))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
( big_p(h(X1))
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
~ big_p(esk1_1(esk2_0)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
( big_p(esk1_1(X1))
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN365+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.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:31:22 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.51 Running first-order model finding
% 0.19/0.51 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.siGVEoTHaj/E---3.1_16321.p
% 0.19/0.52 # Version: 3.1pre001
% 0.19/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # new_bool_3 with pid 16427 completed with status 0
% 0.19/0.52 # Result found by new_bool_3
% 0.19/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52 # Search class: FHHNF-FFSF11-MFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.52 # SAT001_MinMin_p005000_rr_RG with pid 16430 completed with status 0
% 0.19/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52 # Search class: FHHNF-FFSF11-MFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.52 # Preprocessing time : 0.001 s
% 0.19/0.52 # Presaturation interreduction done
% 0.19/0.52
% 0.19/0.52 # Proof found!
% 0.19/0.52 # SZS status Theorem
% 0.19/0.52 # SZS output start CNFRefutation
% See solution above
% 0.19/0.52 # Parsed axioms : 1
% 0.19/0.52 # Removed by relevancy pruning/SinE : 0
% 0.19/0.52 # Initial clauses : 6
% 0.19/0.52 # Removed in clause preprocessing : 0
% 0.19/0.52 # Initial clauses in saturation : 6
% 0.19/0.52 # Processed clauses : 15
% 0.19/0.52 # ...of these trivial : 0
% 0.19/0.52 # ...subsumed : 0
% 0.19/0.52 # ...remaining for further processing : 15
% 0.19/0.52 # Other redundant clauses eliminated : 0
% 0.19/0.52 # Clauses deleted for lack of memory : 0
% 0.19/0.52 # Backward-subsumed : 0
% 0.19/0.52 # Backward-rewritten : 0
% 0.19/0.52 # Generated clauses : 4
% 0.19/0.52 # ...of the previous two non-redundant : 3
% 0.19/0.52 # ...aggressively subsumed : 0
% 0.19/0.52 # Contextual simplify-reflections : 0
% 0.19/0.52 # Paramodulations : 4
% 0.19/0.52 # Factorizations : 0
% 0.19/0.52 # NegExts : 0
% 0.19/0.52 # Equation resolutions : 0
% 0.19/0.52 # Total rewrite steps : 2
% 0.19/0.52 # Propositional unsat checks : 0
% 0.19/0.52 # Propositional check models : 0
% 0.19/0.52 # Propositional check unsatisfiable : 0
% 0.19/0.52 # Propositional clauses : 0
% 0.19/0.52 # Propositional clauses after purity: 0
% 0.19/0.52 # Propositional unsat core size : 0
% 0.19/0.52 # Propositional preprocessing time : 0.000
% 0.19/0.52 # Propositional encoding time : 0.000
% 0.19/0.52 # Propositional solver time : 0.000
% 0.19/0.52 # Success case prop preproc time : 0.000
% 0.19/0.52 # Success case prop encoding time : 0.000
% 0.19/0.52 # Success case prop solver time : 0.000
% 0.19/0.52 # Current number of processed clauses : 9
% 0.19/0.52 # Positive orientable unit clauses : 1
% 0.19/0.52 # Positive unorientable unit clauses: 0
% 0.19/0.52 # Negative unit clauses : 3
% 0.19/0.52 # Non-unit-clauses : 5
% 0.19/0.52 # Current number of unprocessed clauses: 0
% 0.19/0.52 # ...number of literals in the above : 0
% 0.19/0.52 # Current number of archived formulas : 0
% 0.19/0.52 # Current number of archived clauses : 6
% 0.19/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.52 # Non-unit clause-clause subsumptions : 0
% 0.19/0.52 # Unit Clause-clause subsumption calls : 6
% 0.19/0.52 # Rewrite failures with RHS unbound : 0
% 0.19/0.52 # BW rewrite match attempts : 0
% 0.19/0.52 # BW rewrite match successes : 0
% 0.19/0.52 # Condensation attempts : 0
% 0.19/0.52 # Condensation successes : 0
% 0.19/0.52 # Termbank termtop insertions : 438
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.005 s
% 0.19/0.52 # System time : 0.000 s
% 0.19/0.52 # Total time : 0.005 s
% 0.19/0.52 # Maximum resident set size: 1776 pages
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.006 s
% 0.19/0.52 # System time : 0.002 s
% 0.19/0.52 # Total time : 0.008 s
% 0.19/0.52 # Maximum resident set size: 1672 pages
% 0.19/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------