%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN583-1 : TPTP v9.2.1. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n027.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:40:03 PM UTC 2026
% Result : Unsatisfiable 10.02s 2.58s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SYN583-1 : TPTP v9.2.1. Released v2.5.0.
% 0.12/0.15 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.37 % Computer : n027.cluster.edu
% 0.18/0.37 % Model : x86_64 x86_64
% 0.18/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.37 % Memory : 8042.1875MB
% 0.18/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.37 % CPULimit : 300
% 0.18/0.37 % WCLimit : 300
% 0.18/0.37 % DateTime : Thu May 7 13:45:50 EDT 2026
% 0.18/0.37 % CPUTime :
% 0.18/0.37 SPASS-SCL-FOL version:
% 0.30/0.46 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 10.02/2.58 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.02/2.58 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.02/2.58 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.02/2.58 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.02/2.58 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.02/2.58 Execution resolution_3 ended with status: unsatisfiable
% 10.02/2.58 Used heuristic: resolution_3
% 10.02/2.58
% 10.02/2.58 Input Clauses:
% 10.02/2.58
% 10.02/2.58 Predicates: p7 p2 p5 p11 p12 p10
% 10.02/2.58 Fol Constants: c13 c18 c14 c17 c15 c16
% 10.02/2.58 Fol Functions: f3 f9 f8 f6 f4
% 10.02/2.58 Problem Properties:
% 10.02/2.58 This is a full first-order problem without equality.
% 10.02/2.58
% 10.02/2.58 After reduction: Problem Properties:
% 10.02/2.58 This is a full first-order problem without equality.
% 10.02/2.58
% 10.02/2.58
% 10.02/2.58 Reduced Input Clauses:
% 10.02/2.58
% 10.02/2.58 Most General Atoms: p7(x1,x2) p11(x1,x3) p12(x1,x3) p5(x2,x3) p2(x4,x5) p10(x1,x5,x3)
% 10.02/2.58
% 10.02/2.58 === Starting SPASS-SCL-FOL A Little Less Naive, considering 54 atoms initially, heuristics mode: resolution_3 ===
% 10.02/2.58
% 10.02/2.58 === Backtracking. Learning clause 26:3:2:[18.2,5.1,18.3]:TopTop: p2(x0,c18),p2(x0,x1) -> p2(x1,c14)
% 10.02/2.58 === Backtracking. Learning clause 27:2:2:[17.2,1.1]:TopTop: p7(x0,x1) -> p7(x1,x0)
% 10.02/2.58 === Backtracking. Learning clause 28:2:2:[18.2,2.1]:TopTop: p2(x0,x1) -> p2(x1,x0)
% 10.02/2.58 === Backtracking. Learning clause 29:3:2:[22.1,6.1,10.1]:TopTop: p2(x0,x1),p12(f3(c18),x0) -> p11(f8(f9(c17)),x1)
% 10.02/2.58 === Backtracking. Learning clause 30:3:2:[22.2,6.1,10.1]:TopTop: p2(x0,x1),p12(x0,f3(c18)) -> p11(x1,f8(f9(c17)))
% 10.02/2.58 === Backtracking. Learning clause 31:2:1:[18.1,6.1,28.1]:Top: p2(f3(c18),x0) -> p2(x0,f8(f9(c17)))
% 10.02/2.58 === Backtracking. Learning clause 32:2:1:[11.2,9.1,18.3]:Top: p2(x0,f4(f6(c15,c18))),p2(x0,c16) ->
% 10.02/2.58 === Backtracking. Learning clause 33:1:0:[11.2,9.1]:: p2(f4(f6(c15,c18)),c16) ->
% 10.02/2.58 === Clause set with instances from active satisfied. Growing active. New size: 87
% 10.02/2.58 === Restarting.
% 10.02/2.58 === Conflict found: 26:3:2:[18.2,5.1,18.3]:TopTop: p2(x0,c18),p2(x0,x1) -> p2(x1,c14) {x0 -> f3(c13), x1 -> f3(c13)}
% 10.02/2.58 === Backtracking. Learning clause 34:2:1:[26.2,2.1]:Top: p2(x0,c18) -> p2(x0,c14)
% 10.02/2.58 === Backtracking. Learning clause 35:6:4:[25.4,9.1,6.1,22.4,22.4]:TopTopTopTop: p2(x0,c18),p2(x1,c14),p12(x0,x1),p2(x2,c13),p2(x3,c18),p12(x2,x3) ->
% 10.02/2.58 === Backtracking. Learning clause 36:5:4:[16.2,22.3]:TopTopTopTop: p11(x0,x1),p2(x0,x2),p2(x1,x3) -> p2(x0,x1),p12(x2,x3)
% 10.02/2.58 === Backtracking. Learning clause 37:2:1:[14.2,32.1]:Top: p2(x0,f6(c15,c18)),p2(f4(x0),c16) ->
% 10.02/2.58 === Clause set with instances from active satisfied. Growing active. New size: 94
% 10.02/2.58 === Restarting.
% 10.02/2.58 === Conflict found: 26:3:2:[18.2,5.1,18.3]:TopTop: p2(x0,c18),p2(x0,x1) -> p2(x1,c14) {x0 -> f3(c18), x1 -> f8(f9(c17))}
% 10.02/2.58 === Backtracking. Learning clause 38:2:0:[26.2,6.1]:: p2(f3(c18),c18) -> p2(f8(f9(c17)),c14)
% 10.02/2.58 === Conflict found: 36:5:4:[16.2,22.3]:TopTopTopTop: p11(x0,x1),p2(x0,x2),p2(x1,x3) -> p2(x0,x1),p12(x2,x3) {x0 -> f4(f6(c15,c13)), x1 -> c16, x2 -> c13, x3 -> c13}
% 10.02/2.58 === Backtracking. Learning clause 39:4:2:[36.1,7.1]:TopTop: p2(f4(f6(c15,c13)),x0),p2(c16,x1) -> p2(f4(f6(c15,c13)),c16),p12(x0,x1)
% 10.02/2.58 === Conflict found: 36:5:4:[16.2,22.3]:TopTopTopTop: p11(x0,x1),p2(x0,x2),p2(x1,x3) -> p2(x0,x1),p12(x2,x3) {x0 -> f4(f6(c15,c14)), x1 -> c16, x2 -> c13, x3 -> c13}
% 10.02/2.58 === Backtracking. Learning clause 40:4:2:[36.1,8.1]:TopTop: p2(f4(f6(c15,c14)),x0),p2(c16,x1) -> p2(f4(f6(c15,c14)),c16),p12(x0,x1)
% 10.02/2.58 === Conflict found: 37:2:1:[14.2,32.1]:Top: p2(x0,f6(c15,c18)),p2(f4(x0),c16) -> {x0 -> f6(c13,c13)}
% 10.02/2.58 === Backtracking. Learning clause 41:3:2:[37.1,23.3]:TopTop: p2(f4(f6(x0,x1)),c16),p2(x1,c18),p5(x0,c15) ->
% 10.02/2.58 === Clause set with instances from active satisfied. Growing active. New size: 119
% 10.02/2.58 === Restarting.
% 10.02/2.58 === Conflict found: 28:2:2:[18.2,2.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> f8(f9(c17)), x1 -> c14}
% 10.02/2.58 === Backtracking. Learning clause 42:3:1:[28.1,38.2,18.2]:Top: p2(f3(c18),c18),p2(c14,x0) -> p2(x0,f8(f9(c17)))
% 10.02/2.58 === Conflict found: 28:2:2:[18.2,2.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> c16, x1 -> f4(f6(c13,c13))}
% 10.02/2.58 === Backtracking. Learning clause 43:4:3:[28.2,41.1,18.3]:TopTopTop: p2(x0,c18),p5(x1,c15),p2(x2,c16),p2(x2,f4(f6(x1,x0))) ->
% 10.02/2.58 === Conflict found: 39:4:2:[36.1,7.1]:TopTop: p2(f4(f6(c15,c13)),x0),p2(c16,x1) -> p2(f4(f6(c15,c13)),c16),p12(x0,x1) {x0 -> c18, x1 -> c14}
% 10.02/2.58 === Backtracking. Learning clause 46:3:2:[4.0,44.2,3.0,45.3,39.3,41.1]:TopTop: p2(f4(f6(c15,c13)),x0),p2(c16,x1) -> p12(x0,x1)
% 10.02/2.58 === Conflict found: 40:4:2:[36.1,8.1]:TopTop: p2(f4(f6(c15,c14)),x0),p2(c16,x1) -> p2(f4(f6(c15,c14)),c16),p12(x0,x1) {x0 -> c18, x1 -> c14}
% 10.02/2.58 === Backtracking. Learning clause 47:5:2:[40.3,41.1]:TopTop: p2(f4(f6(c15,c14)),x0),p2(c16,x1),p2(c14,c18),p5(c15,c15) -> p12(x0,x1)
% 10.02/2.58 === Backtracking. Learning clause 48:3:2:[14.2,46.1]:TopTop: p2(f6(c15,c13),x0),p2(c16,x1) -> p12(f4(x0),x1)
% 10.02/2.58 === Backtracking. Learning clause 49:5:2:[14.2,47.1]:TopTop: p2(f6(c15,c14),x0),p2(c16,x1),p2(c14,c18),p5(c15,c15) -> p12(f4(x0),x1)
% 10.02/2.58 === Conflict found: 36:5:4:[16.2,22.3]:TopTopTopTop: p11(x0,x1),p2(x0,x2),p2(x1,x3) -> p2(x0,x1),p12(x2,x3) {x0 -> f4(f6(c15,c13)), x1 -> c16, x2 -> f4(f6(c15,c13)), x3 -> c13}
% 10.02/2.58 === Backtracking. Learning clause 50:4:3:[36.2,2.1]:TopTopTop: p11(x0,x1),p2(x1,x2) -> p2(x0,x1),p12(x0,x2)
% 10.02/2.58 === Clause set with instances from active satisfied. Growing active. New size: 150
% 10.02/2.58 === Restarting.
% 10.02/2.58 === Conflict found: 28:2:2:[18.2,2.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> c13, x1 -> f6(c15,c13)}
% 10.02/2.58 === Backtracking. Learning clause 51:3:2:[28.2,48.1]:TopTop: p2(x0,f6(c15,c13)),p2(c16,x1) -> p12(f4(x0),x1)
% 10.02/2.58 === Conflict found: 34:2:1:[26.2,2.1]:Top: p2(x0,c18) -> p2(x0,c14) {x0 -> f6(c15,c13)}
% 10.02/2.58 === Backtracking. Learning clause 52:3:1:[34.2,48.1]:Top: p2(f6(c15,c13),c18),p2(c16,x0) -> p12(f4(c14),x0)
% 10.02/2.58 === Conflict found: 28:2:2:[18.2,2.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> c13, x1 -> f6(c15,c14)}
% 10.02/2.58 === Backtracking. Learning clause 53:5:2:[28.2,49.1]:TopTop: p2(x0,f6(c15,c14)),p2(c16,x1),p2(c14,c18),p5(c15,c15) -> p12(f4(x0),x1)
% 10.02/2.58 === Conflict found: 34:2:1:[26.2,2.1]:Top: p2(x0,c18) -> p2(x0,c14) {x0 -> f6(c15,c14)}
% 10.02/2.58 === Backtracking. Learning clause 54:5:1:[34.2,49.1]:Top: p2(f6(c15,c14),c18),p2(c16,x0),p2(c14,c18),p5(c15,c15) -> p12(f4(c14),x0)
% 10.02/2.58 === Conflict found: 48:3:2:[14.2,46.1]:TopTop: p2(f6(c15,c13),x0),p2(c16,x1) -> p12(f4(x0),x1) {x0 -> f6(c13,c13), x1 -> c13}
% 10.02/2.58 === Backtracking. Learning clause 55:4:3:[48.1,23.3]:TopTopTop: p2(c16,x0),p2(c13,x1),p5(c15,x2) -> p12(f4(f6(x2,x1)),x0)
% 10.02/2.58 === Clause set with instances from active satisfied. Growing active. New size: 160
% 10.02/2.58 === Restarting.
% 10.02/2.58 === Backtracking. Learning clause 56:7:5:[10.1,55.4,36.1]:TopTopTopTopTop: p2(c16,x0),p2(c13,x1),p5(c15,x2),p2(f4(f6(x2,x1)),x3),p2(x0,x4) -> p2(f4(f6(x2,x1)),x0),p12(x3,x4)
% 10.02/2.58 === Backtracking. Learning clause 57:4:3:[10.1,55.4]:TopTopTop: p2(c16,x0),p2(c13,x1),p5(c15,x2) -> p11(f4(f6(x2,x1)),x0)
% 10.02/2.58 === Backtracking. Learning clause 58:4:5:[18.2,23.3]:TopTopTopTopTop: p2(f6(x0,x1),x2),p2(x1,x3),p5(x0,x4) -> p2(x2,f6(x4,x3))
% 10.02/2.58 === Clause set with instances from active satisfied. Growing active. New size: 188
% 10.02/2.58 === Restarting.
% 10.02/2.58 === Conflict found: 57:4:3:[10.1,55.4]:TopTopTop: p2(c16,x0),p2(c13,x1),p5(c15,x2) -> p11(f4(f6(x2,x1)),x0) {x0 -> c16, x1 -> c18, x2 -> c15}
% 10.02/2.58
% 10.02/2.58 SZS status Unsatisfiable
% 10.02/2.58
% 10.02/2.58 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.02/2.58
% 10.02/2.58 SPASS-SCL-FOL Statistics:
% 10.02/2.58 Number of learned clauses: 31
% 10.02/2.58 Number of propagations: 1717
% 10.02/2.58 Number of decisions: 553
% 10.02/2.58 Number of resolutions: 46
% 10.02/2.58 Number of condensations: 0
% 10.02/2.58 Number of sub resolutions: 2
% 10.02/2.58 Number of input literals (deduplicated): 27
% 10.02/2.58 Number of grows: 6
% 10.02/2.58 Number of considered ground atoms: 188
% 10.02/2.58
% 10.02/2.58 Needed: 0:00:01.97
% 10.02/2.58
%------------------------------------------------------------------------------