TSTP Solution File: COL081-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : COL081-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 : 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 : 600s
% DateTime : Fri Jul 15 00:24:49 EDT 2022
% Result : Unsatisfiable 0.21s 0.38s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL081-1 : TPTP v8.1.0. Released v1.2.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue May 31 09:19:41 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.37 # No SInE strategy applied
% 0.21/0.37 # Auto-Mode selected heuristic G_E___208_C02AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.21/0.37 #
% 0.21/0.37 # Presaturation interreduction done
% 0.21/0.37 # Number of axioms: 12 Number of unprocessed: 12
% 0.21/0.37 # Tableaux proof search.
% 0.21/0.37 # APR header successfully linked.
% 0.21/0.37 # Hello from C++
% 0.21/0.38 # The folding up rule is enabled...
% 0.21/0.38 # Local unification is enabled...
% 0.21/0.38 # Any saturation attempts will use folding labels...
% 0.21/0.38 # 12 beginning clauses after preprocessing and clausification
% 0.21/0.38 # Creating start rules for all 1 conjectures.
% 0.21/0.38 # There are 1 start rule candidates:
% 0.21/0.38 # Found 10 unit axioms.
% 0.21/0.38 # 1 start rule tableaux created.
% 0.21/0.38 # 2 extension rule candidate clauses
% 0.21/0.38 # 10 unit axiom clauses
% 0.21/0.38
% 0.21/0.38 # Requested 8, 32 cores available to the main process.
% 0.21/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.21/0.38 # There were 1 total branch saturation attempts.
% 0.21/0.38 # There were 0 of these attempts blocked.
% 0.21/0.38 # There were 0 deferred branch saturation attempts.
% 0.21/0.38 # There were 0 free duplicated saturations.
% 0.21/0.38 # There were 1 total successful branch saturations.
% 0.21/0.38 # There were 0 successful branch saturations in interreduction.
% 0.21/0.38 # There were 0 successful branch saturations on the branch.
% 0.21/0.38 # There were 1 successful branch saturations after the branch.
% 0.21/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.38 # Begin clausification derivation
% 0.21/0.38
% 0.21/0.38 # End clausification derivation
% 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.38 cnf(i_0_23, plain, (apply(identity,X1)=X1)).
% 0.21/0.38 cnf(i_0_13, plain, (apply(k(X1),X2)=X1)).
% 0.21/0.38 cnf(i_0_19, plain, (apply(eq,pair(X1,X1))=projection1)).
% 0.21/0.38 cnf(i_0_14, plain, (apply(projection1,pair(X1,X2))=X1)).
% 0.21/0.38 cnf(i_0_15, plain, (apply(projection2,pair(X1,X2))=X2)).
% 0.21/0.38 cnf(i_0_17, plain, (pair(apply(X1,X2),apply(X3,X2))=apply(pair(X1,X3),X2))).
% 0.21/0.38 cnf(i_0_18, plain, (apply(apply(X1,k(X2)),apply(X3,X2))=apply(apply(apply(abstraction,X1),X3),X2))).
% 0.21/0.38 cnf(i_0_16, plain, (apply(pair(projection1,projection2),X1)=X1)).
% 0.21/0.38 cnf(i_0_22, plain, (projection2!=projection1)).
% 0.21/0.38 cnf(i_0_24, negated_conjecture, (apply(abstraction,k(k(b)))!=k(k(b)))).
% 0.21/0.38 cnf(i_0_21, plain, (X1=X2|apply(X1,n(X1,X2))!=apply(X2,n(X1,X2)))).
% 0.21/0.38 cnf(i_0_20, plain, (apply(eq,pair(X1,X2))=projection2|X1=X2)).
% 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.38 # Begin printing tableau
% 0.21/0.38 # Found 4 steps
% 0.21/0.38 cnf(i_0_24, negated_conjecture, (apply(abstraction,k(k(b)))!=k(k(b))), inference(start_rule)).
% 0.21/0.38 cnf(i_0_25, plain, (apply(abstraction,k(k(b)))!=k(k(b))), inference(extension_rule, [i_0_21])).
% 0.21/0.38 cnf(i_0_27, plain, (apply(apply(abstraction,k(k(b))),n(apply(abstraction,k(k(b))),k(k(b))))!=apply(k(k(b)),n(apply(abstraction,k(k(b))),k(k(b))))), inference(extension_rule, [i_0_21])).
% 0.21/0.38 cnf(i_0_35, plain, (apply(apply(apply(abstraction,k(k(b))),n(apply(abstraction,k(k(b))),k(k(b)))),n(apply(apply(abstraction,k(k(b))),n(apply(abstraction,k(k(b))),k(k(b)))),apply(k(k(b)),n(apply(abstraction,k(k(b))),k(k(b))))))!=apply(apply(k(k(b)),n(apply(abstraction,k(k(b))),k(k(b)))),n(apply(apply(abstraction,k(k(b))),n(apply(abstraction,k(k(b))),k(k(b)))),apply(k(k(b)),n(apply(abstraction,k(k(b))),k(k(b))))))), inference(etableau_closure_rule, [i_0_35, ...])).
% 0.21/0.38 # End printing tableau
% 0.21/0.38 # SZS output end
% 0.21/0.38 # Branches closed with saturation will be marked with an "s"
% 0.21/0.38 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.38 # We now have 1 tableaux to operate on
% 0.21/0.38 # Found closed tableau during pool population.
% 0.21/0.38 # Proof search is over...
% 0.21/0.38 # Freeing feature tree
%------------------------------------------------------------------------------