TSTP Solution File: NLP267_1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NLP267_1 : TPTP v8.2.0. Released v8.2.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 00:55:50 EDT 2024
% Result : Theorem 0.22s 0.50s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 14
% Syntax : Number of formulae : 26 ( 3 unt; 10 typ; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 33 ( 14 ~; 11 |; 2 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 12 ( 0 sgn 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'$ki_world': $tType ).
tff(decl_22,type,
'$ki_local_world': '$ki_world' ).
tff(decl_23,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(decl_24,type,
seventy: $i ).
tff(decl_26,type,
second: $i ).
tff(decl_27,type,
paris: $i ).
tff(decl_29,type,
price: ( '$ki_world' * $i ) > $o ).
tff(decl_30,type,
dest: ( '$ki_world' * $i ) > $o ).
tff(decl_31,type,
class: ( '$ki_world' * $i ) > $o ).
tff(decl_32,type,
esk1_0: '$ki_world' ).
tff(verify,conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> price(X1,seventy) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(law2,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( ( dest(X1,paris)
& class(X1,second) )
=> price(X1,seventy) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',law2) ).
tff(belief1,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> dest(X1,paris) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',belief1) ).
tff(belief2,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> class(X1,second) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',belief2) ).
tff(c_0_4,negated_conjecture,
~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> price(X1,seventy) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_5,plain,
! [X3: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X3)
| ~ dest(X3,paris)
| ~ class(X3,second)
| price(X3,seventy) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[law2])])]) ).
tff(c_0_6,plain,
! [X8: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X8)
| dest(X8,paris) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[belief1])])]) ).
tff(c_0_7,plain,
! [X5: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X5)
| class(X5,second) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[belief2])])]) ).
tff(c_0_8,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk1_0)
& ~ price(esk1_0,seventy) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
tcf(c_0_9,plain,
! [X1: '$ki_world'] :
( price(X1,seventy)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ dest(X1,paris)
| ~ class(X1,second) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_10,plain,
! [X1: '$ki_world'] :
( dest(X1,paris)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_11,plain,
! [X1: '$ki_world'] :
( class(X1,second)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_12,negated_conjecture,
~ price(esk1_0,seventy),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_13,plain,
! [X1: '$ki_world'] :
( price(X1,seventy)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
tcf(c_0_14,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NLP267_1 : TPTP v8.2.0. Released v8.2.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n021.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 22:18:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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/benchmark/theBenchmark.p
% 0.22/0.50 # Version: 3.1.0
% 0.22/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50 # Starting sh5l with 300s (1) cores
% 0.22/0.50 # new_bool_3 with pid 7659 completed with status 0
% 0.22/0.50 # Result found by new_bool_3
% 0.22/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.50 # Search class: FHHNF-FFSF00-SFFFFFNN
% 0.22/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.50 # SAT001_MinMin_p005000_rr_RG with pid 7666 completed with status 0
% 0.22/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.50 # Search class: FHHNF-FFSF00-SFFFFFNN
% 0.22/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.50 # Preprocessing time : 0.001 s
% 0.22/0.50 # Presaturation interreduction done
% 0.22/0.50
% 0.22/0.50 # Proof found!
% 0.22/0.50 # SZS status Theorem
% 0.22/0.50 # SZS output start CNFRefutation
% See solution above
% 0.22/0.50 # Parsed axioms : 18
% 0.22/0.50 # Removed by relevancy pruning/SinE : 11
% 0.22/0.50 # Initial clauses : 8
% 0.22/0.50 # Removed in clause preprocessing : 0
% 0.22/0.50 # Initial clauses in saturation : 8
% 0.22/0.50 # Processed clauses : 13
% 0.22/0.50 # ...of these trivial : 0
% 0.22/0.50 # ...subsumed : 1
% 0.22/0.50 # ...remaining for further processing : 12
% 0.22/0.50 # Other redundant clauses eliminated : 0
% 0.22/0.50 # Clauses deleted for lack of memory : 0
% 0.22/0.50 # Backward-subsumed : 0
% 0.22/0.50 # Backward-rewritten : 0
% 0.22/0.50 # Generated clauses : 1
% 0.22/0.50 # ...of the previous two non-redundant : 0
% 0.22/0.50 # ...aggressively subsumed : 0
% 0.22/0.50 # Contextual simplify-reflections : 3
% 0.22/0.50 # Paramodulations : 1
% 0.22/0.50 # Factorizations : 0
% 0.22/0.50 # NegExts : 0
% 0.22/0.50 # Equation resolutions : 0
% 0.22/0.50 # Disequality decompositions : 0
% 0.22/0.50 # Total rewrite steps : 1
% 0.22/0.50 # ...of those cached : 0
% 0.22/0.50 # Propositional unsat checks : 0
% 0.22/0.50 # Propositional check models : 0
% 0.22/0.50 # Propositional check unsatisfiable : 0
% 0.22/0.50 # Propositional clauses : 0
% 0.22/0.50 # Propositional clauses after purity: 0
% 0.22/0.50 # Propositional unsat core size : 0
% 0.22/0.50 # Propositional preprocessing time : 0.000
% 0.22/0.50 # Propositional encoding time : 0.000
% 0.22/0.50 # Propositional solver time : 0.000
% 0.22/0.50 # Success case prop preproc time : 0.000
% 0.22/0.50 # Success case prop encoding time : 0.000
% 0.22/0.50 # Success case prop solver time : 0.000
% 0.22/0.50 # Current number of processed clauses : 5
% 0.22/0.50 # Positive orientable unit clauses : 1
% 0.22/0.50 # Positive unorientable unit clauses: 0
% 0.22/0.50 # Negative unit clauses : 1
% 0.22/0.50 # Non-unit-clauses : 3
% 0.22/0.50 # Current number of unprocessed clauses: 2
% 0.22/0.50 # ...number of literals in the above : 5
% 0.22/0.50 # Current number of archived formulas : 0
% 0.22/0.50 # Current number of archived clauses : 7
% 0.22/0.50 # Clause-clause subsumption calls (NU) : 14
% 0.22/0.50 # Rec. Clause-clause subsumption calls : 10
% 0.22/0.50 # Non-unit clause-clause subsumptions : 4
% 0.22/0.50 # Unit Clause-clause subsumption calls : 0
% 0.22/0.50 # Rewrite failures with RHS unbound : 0
% 0.22/0.50 # BW rewrite match attempts : 0
% 0.22/0.50 # BW rewrite match successes : 0
% 0.22/0.50 # Condensation attempts : 0
% 0.22/0.50 # Condensation successes : 0
% 0.22/0.50 # Termbank termtop insertions : 689
% 0.22/0.50 # Search garbage collected termcells : 123
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.004 s
% 0.22/0.50 # System time : 0.001 s
% 0.22/0.50 # Total time : 0.005 s
% 0.22/0.50 # Maximum resident set size: 1760 pages
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.005 s
% 0.22/0.50 # System time : 0.003 s
% 0.22/0.50 # Total time : 0.008 s
% 0.22/0.50 # Maximum resident set size: 1712 pages
% 0.22/0.50 % E---3.1 exiting
% 0.22/0.51 % E exiting
%------------------------------------------------------------------------------