TSTP Solution File: SYN332-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN332-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n006.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 : 600s
% DateTime : Thu Jul 21 06:09:59 EDT 2022
% Result : Unsatisfiable 0.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN332-1 : TPTP v8.1.0. Released v1.2.0.
% 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n006.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 : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 12 01:17:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 14 Number of unprocessed: 14
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 14 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 14 conjectures.
% 0.13/0.37 # There are 14 start rule candidates:
% 0.13/0.37 # Found 0 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 14 start rule tableaux created.
% 0.13/0.37 # 14 extension rule candidate clauses
% 0.13/0.37 # 0 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.54 # There were 1 total branch saturation attempts.
% 0.19/0.54 # There were 0 of these attempts blocked.
% 0.19/0.54 # There were 0 deferred branch saturation attempts.
% 0.19/0.54 # There were 0 free duplicated saturations.
% 0.19/0.54 # There were 1 total successful branch saturations.
% 0.19/0.54 # There were 0 successful branch saturations in interreduction.
% 0.19/0.54 # There were 0 successful branch saturations on the branch.
% 0.19/0.54 # There were 1 successful branch saturations after the branch.
% 0.19/0.54 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.54 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.54 # Begin clausification derivation
% 0.19/0.54
% 0.19/0.54 # End clausification derivation
% 0.19/0.54 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.54 cnf(i_0_16, negated_conjecture, (f(X1,z(X1,X2))|f(X2,X1))).
% 0.19/0.54 cnf(i_0_17, negated_conjecture, (~f(X1,z(X1,X2))|~f(X2,X1)|~f(X1,X2))).
% 0.19/0.54 cnf(i_0_28, negated_conjecture, (~f(z(X1,X2),X2)|~f(X2,X1)|~f(X1,X2))).
% 0.19/0.54 cnf(i_0_18, negated_conjecture, (f(X1,z(X1,X2))|~f(z(X1,X2),X1))).
% 0.19/0.54 cnf(i_0_15, negated_conjecture, (f(X1,z(X1,X2))|f(X1,X2))).
% 0.19/0.54 cnf(i_0_26, negated_conjecture, (f(z(X1,X2),X2)|f(X2,X1)|~f(X1,X2))).
% 0.19/0.54 cnf(i_0_19, negated_conjecture, (f(z(X1,X2),X1)|~f(X1,z(X1,X2)))).
% 0.19/0.54 cnf(i_0_27, negated_conjecture, (f(X1,X2)|f(X2,X1)|~f(z(X1,X2),X2))).
% 0.19/0.54 cnf(i_0_22, negated_conjecture, (f(X1,X2)|~f(z(X1,X2),z(X1,X2))|~f(X2,X1))).
% 0.19/0.54 cnf(i_0_21, negated_conjecture, (f(X1,z(X2,X1))|~f(X2,z(X2,X1)))).
% 0.19/0.54 cnf(i_0_20, negated_conjecture, (f(X1,z(X1,X2))|~f(X2,z(X1,X2)))).
% 0.19/0.54 cnf(i_0_23, negated_conjecture, (f(z(X1,X2),z(X1,X2))|f(X2,X1))).
% 0.19/0.54 cnf(i_0_24, negated_conjecture, (f(z(X1,X2),z(X1,X2))|~f(X1,X2))).
% 0.19/0.54 cnf(i_0_25, negated_conjecture, (f(z(X1,X2),X2)|f(X1,X2)|~f(X2,X1))).
% 0.19/0.54 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.54 # Begin printing tableau
% 0.19/0.54 # Found 11 steps
% 0.19/0.54 cnf(i_0_15, negated_conjecture, (f(z(X4,X4),z(z(X4,X4),z(z(X4,X4),z(X4,X4))))|f(z(X4,X4),z(z(X4,X4),z(X4,X4)))), inference(start_rule)).
% 0.19/0.54 cnf(i_0_51, plain, (f(z(X4,X4),z(z(X4,X4),z(z(X4,X4),z(X4,X4))))), inference(extension_rule, [i_0_24])).
% 0.19/0.54 cnf(i_0_2966, plain, (f(z(z(X4,X4),z(z(X4,X4),z(z(X4,X4),z(X4,X4)))),z(z(X4,X4),z(z(X4,X4),z(z(X4,X4),z(X4,X4)))))), inference(extension_rule, [i_0_17])).
% 0.19/0.54 cnf(i_0_2974, plain, (~f(z(z(X4,X4),z(z(X4,X4),z(z(X4,X4),z(X4,X4)))),z(z(X4,X4),z(z(X4,X4),z(z(X4,X4),z(X4,X4)))))), inference(closure_rule, [i_0_2966])).
% 0.19/0.54 cnf(i_0_2972, plain, (~f(z(z(X4,X4),z(z(X4,X4),z(z(X4,X4),z(X4,X4)))),z(z(z(X4,X4),z(z(X4,X4),z(z(X4,X4),z(X4,X4)))),z(z(X4,X4),z(z(X4,X4),z(z(X4,X4),z(X4,X4))))))), inference(extension_rule, [i_0_18])).
% 0.19/0.54 cnf(i_0_52, plain, (f(z(X4,X4),z(z(X4,X4),z(X4,X4)))), inference(extension_rule, [i_0_17])).
% 0.19/0.54 cnf(i_0_19209, plain, (~f(z(X4,X4),z(X4,X4))), inference(extension_rule, [i_0_23])).
% 0.19/0.54 cnf(i_0_24463, plain, (f(X4,X4)), inference(extension_rule, [i_0_24])).
% 0.19/0.54 cnf(i_0_27474, plain, (f(z(X4,X4),z(X4,X4))), inference(closure_rule, [i_0_19209])).
% 0.19/0.54 cnf(i_0_19210, plain, (~f(z(X4,X4),z(X4,X4))), inference(closure_rule, [i_0_19209])).
% 0.19/0.54 cnf(i_0_2980, plain, (~f(z(z(z(X4,X4),z(z(X4,X4),z(z(X4,X4),z(X4,X4)))),z(z(X4,X4),z(z(X4,X4),z(z(X4,X4),z(X4,X4))))),z(z(X4,X4),z(z(X4,X4),z(z(X4,X4),z(X4,X4)))))), inference(etableau_closure_rule, [i_0_2980, ...])).
% 0.19/0.54 # End printing tableau
% 0.19/0.54 # SZS output end
% 0.19/0.54 # Branches closed with saturation will be marked with an "s"
% 0.19/0.54 # Child (874) has found a proof.
% 0.19/0.54
% 0.19/0.54 # Proof search is over...
% 0.19/0.54 # Freeing feature tree
%------------------------------------------------------------------------------