%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : MSC004-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n026.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 : Thu May 7 07:28:55 PM UTC 2026
% Result : Unsatisfiable 0.40s 0.57s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC004-1 : TPTP v9.2.1. Released v1.0.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.34 % Computer : n026.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Thu May 7 12:43:09 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 SPASS-SCL-FOL version:
% 0.20/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.40/0.57 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.57 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.57 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.57 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.57 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.57 Execution resolution_1 ended with status: unsatisfiable
% 0.40/0.57 Used heuristic: resolution_1
% 0.40/0.57
% 0.40/0.57 Input Clauses:
% 0.40/0.57
% 0.40/0.57 Predicates: in has_parts
% 0.40/0.57 Fol Constants: john boy human n5 fingers hand n2 arm n1
% 0.40/0.57 Fol Functions: object_in times
% 0.40/0.57 Problem Properties:
% 0.40/0.57 This is a full first-order problem without equality.
% 0.40/0.57
% 0.40/0.57 After reduction: Problem Properties:
% 0.40/0.57 This is a full first-order problem without equality.
% 0.40/0.57
% 0.40/0.57
% 0.40/0.57 Reduced Input Clauses:
% 0.40/0.57
% 0.40/0.57 Most General Atoms: has_parts(x0,x1,x2) in(object_in(x0,x2,x3,x1,x4),x2) in(x0,boy) in(x0,human) in(x0,hand) in(x0,arm)
% 0.40/0.57
% 0.40/0.57 === Starting SPASS-SCL-FOL A Little Less Naive, considering 10 atoms initially, heuristics mode: resolution_1 ===
% 0.40/0.57
% 0.40/0.57 === Backtracking. Learning clause 9:3:3:[5.2,2.2]:TopTopTop: in(object_in(x0,x1,fingers,x2,n5),hand),has_parts(x0,x2,x1) -> has_parts(x0,times(x2,n5),fingers)
% 0.40/0.57 === Backtracking. Learning clause 10:3:3:[7.2,2.2]:TopTopTop: in(object_in(x0,x1,hand,x2,n1),arm),has_parts(x0,x2,x1) -> has_parts(x0,times(x2,n1),hand)
% 0.40/0.57 === Backtracking. Learning clause 11:3:3:[6.2,2.2]:TopTopTop: in(object_in(x0,x1,arm,x2,n2),human),has_parts(x0,x2,x1) -> has_parts(x0,times(x2,n2),arm)
% 0.40/0.57 === Clause set with instances from active satisfied. Growing active. New size: 17
% 0.40/0.57 === Restarting.
% 0.40/0.57 === Conflict found: 9:3:3:[5.2,2.2]:TopTopTop: in(object_in(x0,x1,fingers,x2,n5),hand),has_parts(x0,x2,x1) -> has_parts(x0,times(x2,n5),fingers) {x0 -> john, x1 -> hand, x2 -> john}
% 0.40/0.57 === Backtracking. Learning clause 12:2:2:[9.1,1.2]:TopTop: has_parts(x0,x1,hand) -> has_parts(x0,times(x1,n5),fingers)
% 0.40/0.57 === Clause set with instances from active satisfied. Growing active. New size: 22
% 0.40/0.57 === Restarting.
% 0.40/0.57 === Backtracking. Learning clause 13:2:2:[1.2,10.1]:TopTop: has_parts(x0,x1,arm) -> has_parts(x0,times(x1,n1),hand)
% 0.40/0.57 === Clause set with instances from active satisfied. Growing active. New size: 25
% 0.40/0.57 === Restarting.
% 0.40/0.57 === Conflict found: 12:2:2:[9.1,1.2]:TopTop: has_parts(x0,x1,hand) -> has_parts(x0,times(x1,n5),fingers) {x0 -> john, x1 -> times(n2,n1)}
% 0.40/0.57 === Backtracking. Learning clause 14:1:0:[12.2,8.1]:: has_parts(john,times(n2,n1),hand) ->
% 0.40/0.57 === Clause set with instances from active satisfied. Growing active. New size: 26
% 0.40/0.57 === Restarting.
% 0.40/0.57 === Conflict found: 12:2:2:[9.1,1.2]:TopTop: has_parts(x0,x1,hand) -> has_parts(x0,times(x1,n5),fingers) {x0 -> object_in(john,john,fingers,john,times(john,n5)), x1 -> john}
% 0.40/0.57 === Backtracking. Learning clause 15:3:4:[12.2,2.2]:TopTopTopTop: has_parts(object_in(x0,x1,fingers,x2,times(x3,n5)),x3,hand),has_parts(x0,x2,x1) -> has_parts(x0,times(x2,times(x3,n5)),fingers)
% 0.40/0.57 === Clause set with instances from active satisfied. Growing active. New size: 32
% 0.40/0.57 === Restarting.
% 0.40/0.57 === Conflict found: 11:3:3:[6.2,2.2]:TopTopTop: in(object_in(x0,x1,arm,x2,n2),human),has_parts(x0,x2,x1) -> has_parts(x0,times(x2,n2),arm) {x0 -> john, x1 -> human, x2 -> john}
% 0.40/0.57 === Backtracking. Learning clause 16:2:2:[11.1,1.2]:TopTop: has_parts(x0,x1,human) -> has_parts(x0,times(x1,n2),arm)
% 0.40/0.57 === Clause set with instances from active satisfied. Growing active. New size: 35
% 0.40/0.57 === Restarting.
% 0.40/0.57 === Clause set with instances from active satisfied. Growing active. New size: 99
% 0.40/0.57 === Backtracking. Learning clause 17:1:0:[4.1,3.1,6.1]:: -> has_parts(john,n2,arm)
% 0.40/0.57 === Conflict found: 13:2:2:[1.2,10.1]:TopTop: has_parts(x0,x1,arm) -> has_parts(x0,times(x1,n1),hand) {x0 -> john, x1 -> n2}
% 0.40/0.57
% 0.40/0.57 SZS status Unsatisfiable
% 0.40/0.57
% 0.40/0.57 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.57
% 0.40/0.57 SPASS-SCL-FOL Statistics:
% 0.40/0.57 Number of learned clauses: 9
% 0.40/0.57 Number of propagations: 95
% 0.40/0.57 Number of decisions: 166
% 0.40/0.57 Number of resolutions: 12
% 0.40/0.57 Number of condensations: 0
% 0.40/0.57 Number of sub resolutions: 0
% 0.40/0.57 Number of input literals (deduplicated): 13
% 0.40/0.57 Number of grows: 7
% 0.40/0.57 Number of considered ground atoms: 99
% 0.40/0.57
% 0.40/0.57 Needed: 0:00:00.01
% 0.40/0.57
%------------------------------------------------------------------------------