TSTP Solution File: NLP103-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NLP103-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 18:42:13 EDT 2023
% Result : Satisfiable 0.19s 0.47s
% Output : Saturation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause1)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_40,negated_conjecture,
actual_world(skc20),
clause1,
[final] ).
cnf(c_0_71,negated_conjecture,
actual_world(skc8),
clause2,
[final] ).
cnf(c_0_78,negated_conjecture,
ssSkC0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_42]),
[final] ).
cnf(c_0_92,negated_conjecture,
( ~ see(X1,X2)
| ~ agent(X1,X2,skf12(X1,X3,X4))
| ~ agent(X1,X5,X4)
| ~ patient(X1,X2,X4)
| ~ patient(X1,X5,X6)
| ~ restaurant(X1,X3)
| ~ human_person(X1,X4)
| ~ coffee(X1,X6)
| ~ drink(X1,X5)
| ~ nonreflexive(X1,X2)
| ~ nonreflexive(X1,X5)
| ~ past(X1,X2)
| ~ past(X1,X5)
| ~ event(X1,X2)
| ~ event(X1,X5)
| ~ actual_world(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_78])]),
[final] ).
cnf(c_0_93,negated_conjecture,
( in(X1,skf12(X1,X2,X3),X2)
| ~ agent(X1,X4,X5)
| ~ patient(X1,X4,X6)
| ~ restaurant(X1,X2)
| ~ human_person(X1,X5)
| ~ coffee(X1,X6)
| ~ drink(X1,X4)
| ~ nonreflexive(X1,X4)
| ~ past(X1,X4)
| ~ event(X1,X4)
| ~ actual_world(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_78])]),
[final] ).
cnf(c_0_94,negated_conjecture,
( customer(skc8,skf12(skc8,X1,X2))
| ~ customer(skc8,X3)
| ~ in(skc8,X3,skc10)
| ~ patient(skc8,skf8(X3),X4)
| ~ restaurant(skc8,X5)
| ~ human_person(skc8,X3)
| ~ coffee(skc8,X4)
| ~ drink(skc8,skf8(X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_78])]),
[final] ).
cnf(c_0_95,negated_conjecture,
( customer(X1,skf12(X1,X2,X3))
| ~ agent(X1,X4,X5)
| ~ patient(X1,X4,X6)
| ~ restaurant(X1,X7)
| ~ human_person(X1,X5)
| ~ coffee(X1,X6)
| ~ drink(X1,X4)
| ~ nonreflexive(X1,X4)
| ~ past(X1,X4)
| ~ event(X1,X4)
| ~ actual_world(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_78])]),
[final] ).
cnf(c_0_96,negated_conjecture,
( agent(skc8,skf8(X1),X1)
| ~ customer(skc8,X1)
| ~ in(skc8,X1,skc10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_78])]),
[final] ).
cnf(c_0_97,negated_conjecture,
( patient(skc8,skf8(X1),skf10(X1))
| ~ customer(skc8,X2)
| ~ in(skc8,X2,skc10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_78])]),
[final] ).
cnf(c_0_98,negated_conjecture,
( agent(skc8,skf9(X1),skf10(X1))
| ~ customer(skc8,X2)
| ~ in(skc8,X2,skc10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_78])]),
[final] ).
cnf(c_0_99,negated_conjecture,
( patient(skc8,skf9(X1),skc9)
| ~ customer(skc8,X2)
| ~ in(skc8,X2,skc10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_78])]),
[final] ).
cnf(c_0_100,negated_conjecture,
( in(skc8,skf12(skc8,X1,X2),X1)
| ~ customer(skc8,X3)
| ~ in(skc8,X3,skc10)
| ~ patient(skc8,skf8(X3),X4)
| ~ restaurant(skc8,X1)
| ~ human_person(skc8,X3)
| ~ coffee(skc8,X4)
| ~ drink(skc8,skf8(X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_78])]),
[final] ).
cnf(c_0_101,negated_conjecture,
( event(skc8,skf9(X1))
| ~ customer(skc8,X2)
| ~ in(skc8,X2,skc10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_78])]),
[final] ).
cnf(c_0_102,negated_conjecture,
( event(skc8,skf8(X1))
| ~ customer(skc8,X2)
| ~ in(skc8,X2,skc10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_78])]),
[final] ).
cnf(c_0_103,negated_conjecture,
( past(skc8,skf9(X1))
| ~ customer(skc8,X2)
| ~ in(skc8,X2,skc10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_78])]),
[final] ).
cnf(c_0_104,negated_conjecture,
( past(skc8,skf8(X1))
| ~ customer(skc8,X2)
| ~ in(skc8,X2,skc10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_78])]),
[final] ).
cnf(c_0_105,negated_conjecture,
( nonreflexive(skc8,skf9(X1))
| ~ customer(skc8,X2)
| ~ in(skc8,X2,skc10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_78])]),
[final] ).
cnf(c_0_106,negated_conjecture,
( nonreflexive(skc8,skf8(X1))
| ~ customer(skc8,X2)
| ~ in(skc8,X2,skc10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_78])]),
[final] ).
cnf(c_0_107,negated_conjecture,
( drink(skc8,skf9(X1))
| ~ customer(skc8,X2)
| ~ in(skc8,X2,skc10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_78])]),
[final] ).
cnf(c_0_108,negated_conjecture,
( human_person(skc8,skf10(X1))
| ~ customer(skc8,X2)
| ~ in(skc8,X2,skc10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_78])]),
[final] ).
cnf(c_0_109,negated_conjecture,
( see(skc8,skf8(X1))
| ~ customer(skc8,X2)
| ~ in(skc8,X2,skc10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78])]),
[final] ).
cnf(c_0_110,negated_conjecture,
( ~ customer(skc8,skf12(skc8,X1,X2))
| ~ in(skc8,skf12(skc8,X1,X2),skc10)
| ~ agent(skc8,X3,X2)
| ~ patient(skc8,skf8(skf12(skc8,X1,X2)),X2)
| ~ patient(skc8,X3,X4)
| ~ restaurant(skc8,X1)
| ~ human_person(skc8,X2)
| ~ coffee(skc8,X4)
| ~ drink(skc8,X3)
| ~ nonreflexive(skc8,X3)
| ~ past(skc8,X3)
| ~ event(skc8,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_78])]),
[final] ).
cnf(c_0_111,negated_conjecture,
coffee(skc8,skc9),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_78])]),
[final] ).
cnf(c_0_112,negated_conjecture,
restaurant(skc8,skc10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_78])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : NLP103-1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n017.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 10:40:26 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.qAoiTol8vt/E---3.1_23935.p
% 0.19/0.47 # Version: 3.1pre001
% 0.19/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47 # Starting sh5l with 300s (1) cores
% 0.19/0.47 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 24070 completed with status 1
% 0.19/0.47 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: FGHNF-FFMM31-SFFFFFNN
% 0.19/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.47 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.47 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.47 # Starting sh5l with 136s (1) cores
% 0.19/0.47 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 24077 completed with status 1
% 0.19/0.47 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: FGHNF-FFMM31-SFFFFFNN
% 0.19/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.47 # Preprocessing time : 0.001 s
% 0.19/0.47 # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47 # No proof found!
% 0.19/0.47 # SZS status Satisfiable
% 0.19/0.47 # SZS output start Saturation
% See solution above
% 0.19/0.47 # Parsed axioms : 38
% 0.19/0.47 # Removed by relevancy pruning/SinE : 0
% 0.19/0.47 # Initial clauses : 38
% 0.19/0.47 # Removed in clause preprocessing : 0
% 0.19/0.47 # Initial clauses in saturation : 38
% 0.19/0.47 # Processed clauses : 116
% 0.19/0.47 # ...of these trivial : 0
% 0.19/0.47 # ...subsumed : 3
% 0.19/0.47 # ...remaining for further processing : 113
% 0.19/0.47 # Other redundant clauses eliminated : 0
% 0.19/0.47 # Clauses deleted for lack of memory : 0
% 0.19/0.47 # Backward-subsumed : 7
% 0.19/0.47 # Backward-rewritten : 44
% 0.19/0.47 # Generated clauses : 28
% 0.19/0.47 # ...of the previous two non-redundant : 43
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 32
% 0.19/0.47 # Paramodulations : 28
% 0.19/0.47 # Factorizations : 0
% 0.19/0.47 # NegExts : 0
% 0.19/0.47 # Equation resolutions : 0
% 0.19/0.47 # Total rewrite steps : 61
% 0.19/0.47 # Propositional unsat checks : 0
% 0.19/0.47 # Propositional check models : 0
% 0.19/0.47 # Propositional check unsatisfiable : 0
% 0.19/0.47 # Propositional clauses : 0
% 0.19/0.47 # Propositional clauses after purity: 0
% 0.19/0.47 # Propositional unsat core size : 0
% 0.19/0.47 # Propositional preprocessing time : 0.000
% 0.19/0.47 # Propositional encoding time : 0.000
% 0.19/0.47 # Propositional solver time : 0.000
% 0.19/0.47 # Success case prop preproc time : 0.000
% 0.19/0.47 # Success case prop encoding time : 0.000
% 0.19/0.47 # Success case prop solver time : 0.000
% 0.19/0.47 # Current number of processed clauses : 24
% 0.19/0.47 # Positive orientable unit clauses : 5
% 0.19/0.47 # Positive unorientable unit clauses: 0
% 0.19/0.47 # Negative unit clauses : 0
% 0.19/0.47 # Non-unit-clauses : 19
% 0.19/0.47 # Current number of unprocessed clauses: 0
% 0.19/0.47 # ...number of literals in the above : 0
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 89
% 0.19/0.47 # Clause-clause subsumption calls (NU) : 2010
% 0.19/0.47 # Rec. Clause-clause subsumption calls : 638
% 0.19/0.47 # Non-unit clause-clause subsumptions : 42
% 0.19/0.47 # Unit Clause-clause subsumption calls : 0
% 0.19/0.47 # Rewrite failures with RHS unbound : 0
% 0.19/0.47 # BW rewrite match attempts : 1
% 0.19/0.47 # BW rewrite match successes : 1
% 0.19/0.47 # Condensation attempts : 0
% 0.19/0.47 # Condensation successes : 0
% 0.19/0.47 # Termbank termtop insertions : 4056
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.007 s
% 0.19/0.47 # System time : 0.003 s
% 0.19/0.47 # Total time : 0.010 s
% 0.19/0.47 # Maximum resident set size: 1700 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.032 s
% 0.19/0.47 # System time : 0.010 s
% 0.19/0.47 # Total time : 0.042 s
% 0.19/0.47 # Maximum resident set size: 1720 pages
% 0.19/0.47 % E---3.1 exiting
% 0.19/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------